Sample determination for adaptive loop filtering

ABSTRACT

A method of video processing includes determining a classification of samples of a block in a video picture of a video according to a rule, wherein the video picture is divided into multiple regions, and wherein the rule disallows use of neighboring samples of a current sample across one or more boundaries of the multiple regions for the classification. The one or more boundaries of the multiple regions includes a virtual boundary for an adaptive loop filtering (ALF) process. The method also includes performing a conversion between the block and a bitstream representation of the video by selectively applying the ALF process according to the classification.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.17/570,682, filed on Jan. 7, 2022, which is a continuation ofInternational Patent Application No. PCT/CN2020/100962, filed on Jul. 9,2020, which claims the priority to and benefits of International PatentApplication No. PCT/CN2019/095330, filed on Jul. 9, 2019. All theaforementioned patent applications are hereby incorporated by referencein their entireties.

TECHNICAL FIELD

This patent document is directed generally to video coding and decodingtechnologies.

BACKGROUND

Video coding standards have evolved primarily through the development ofthe well-known International Telecommunication Union (ITU)Telecommunication Standardization Sector (ITU-T) and InternationalOrganization for Standardization (ISO)/International ElectrotechnicalCommission (IEC) standards. The ITU-T produced H.261 and H.263, ISO/IECproduced Moving Picture Experts Group (MPEG)-1 and MPEG-4 Visual, andthe two organizations jointly produced the H.262/MPEG-2 Video andH.264/MPEG-4 Advanced Video Coding (AVC) and H.265/High Efficiency VideoCoding (HEVC) standards. Since H.262, the video coding standards arebased on the hybrid video coding structure wherein temporal predictionplus transform coding are utilized. To explore the future video codingtechnologies beyond HEVC, Joint Video Exploration Team (JVET) wasfounded by Video Coding Experts Group (VCEG) and MPEG jointly in 2015.Since then, many new methods have been adopted by JVET and put into thereference software named Joint Exploration Model (JEM). In April 2018,the JVET between VCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) wascreated to work on the next generation Versatile Video Coding (VVC)standard targeting at 50% bitrate reduction compared to HEVC.

SUMMARY

Using the disclosed video coding, transcoding or decoding techniques,embodiments of video encoders or decoders can handle virtual boundariesof coding tree blocks to provide better compression efficiency andsimpler implementations of coding or decoding tools.

In one example aspect, a method of video processing is disclosed. Themethod includes determining a classification of samples of a block in avideo picture of a video according to a rule. The video picture isdivided into multiple regions. The rule disallows use of neighboringsamples of a current sample across one or more boundaries of themultiple regions for the classification. The one or more boundaries ofthe multiple regions comprise a virtual boundary for an adaptive loopfiltering (ALF) process. The method also includes performing aconversion between the block and a bitstream representation of the videoby selectively applying an adaptive loop filter according to theclassification.

In another example aspect, a method of video processing is disclosed.The method includes performing a conversion between video blocks of avideo picture and a bitstream representation thereof. Here, the videoblocks are processed using logical groupings of coding tree blocks andthe coding tree blocks are processed based on whether a bottom boundaryof a bottom coding tree block is outside a bottom boundary of the videopicture.

In another example aspect, another video processing method is disclosed.The method includes determining, based on a condition of a coding treeblock of a current video block, a usage status of virtual samples duringan in-loop filtering and performing a conversion between the video blockand a bitstream representation of the video block consistent with theusage status of virtual samples.

In yet another example aspect, another video processing method isdisclosed. The method includes determining, during a conversion betweena video picture that is logically grouped into one or more video slicesor video bricks, and a bitstream representation of the video picture, todisable a use of samples in another slice or brick in the adaptive loopfilter process and performing the conversion consistent with thedetermining.

In yet another example aspect, another video processing method isdisclosed. The method includes determining, during a conversion betweena current video block of a video picture and a bitstream representationof the current video block, that the current video block includessamples located at a boundary of a video unit of the video picture andperforming the conversion based on the determining, wherein theperforming the conversion includes generating virtual samples for anin-loop filtering process using a unified method that is same for allboundary types in the video picture.

In yet another example aspect, another method of video processing isdisclosed. The method includes determining to apply, during a conversionbetween a current video block of a video picture and a bitstreamrepresentation thereof, one of multiple adaptive loop filter (ALF)sample selection methods available for the video picture during theconversion and performing the conversion by applying the one of multipleALF sample selection methods.

In yet another example aspect, another method of video processing isdisclosed. The method includes performing, based on a boundary rule, anin-loop filtering operation over samples of a current video block of avideo picture during a conversion between the current video block and abitstream representation of a current video block; wherein the boundaryrule disables using samples that cross a virtual pipeline data unit(VPDU) of the video picture and performing the conversion using a resultof the in-loop filtering operation.

In yet another example aspect, another method of video processing isdisclosed. The method includes performing, based on a boundary rule, anin-loop filtering operation over samples of a current video block of avideo picture during a conversion between the current video block and abitstream representation of a current video block; wherein the boundaryrule specifies to use, for locations of the current video block across avideo unit boundary, samples that are generated without using paddingand performing the conversion using a result of the in-loop filteringoperation.

In yet another example aspect, another method of video processing isdisclosed. The method includes performing, based on a boundary rule, anin-loop filtering operation over samples of a current video block of avideo picture during a conversion between the current video block and abitstream representation of a current video block; wherein the boundaryrule specifies selecting, for the in-loop filtering operation, a filterhaving dimensions such that samples of current video block used duringthe in-loop filtering do not cross a boundary of a video unit of thevideo picture and performing the conversion using a result of thein-loop filtering operation.

In yet another example aspect, another method of video processing isdisclosed. The method includes performing, based on a boundary rule, anin-loop filtering operation over samples of a current video block of avideo picture during a conversion between the current video block and abitstream representation of a current video block; wherein the boundaryrule specifies selecting, for the in-loop filtering operation, clippingparameters or filter coefficients based on whether or not padded samplesare needed for the in-loop filtering and performing the conversion usinga result of the in-loop filtering operation.

In yet another example aspect, another method of video processing isdisclosed. The method includes performing, based on a boundary rule, anin-loop filtering operation over samples of a current video block of avideo picture during a conversion between the current video block and abitstream representation of a current video block; wherein the boundaryrule depends on a color component identity of the current video blockand performing the conversion using a result of the in-loop filteringoperation.

In yet another example aspect, a video encoding apparatus configured toperform an above-described method is disclosed.

In yet another example aspect, a video decoder that is configured toperform an above-described method is disclosed.

In yet another example aspect, a machine-readable medium is disclosed.The medium stores code which, upon execution, causes a processor toimplement one or more of the above-described methods.

The above and other aspects and features of the disclosed embodimentsare described in greater detail in the drawings, the description and theclaims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example of a picture with 18 by 12 luma coding treeunits (CTUs) that is partitioned into 12 tiles and 3 raster-scan slices.

FIG. 2 shows an example of a picture with 18 by 12 luma CTUs that ispartitioned into 24 tiles and 9 rectangular slices.

FIG. 3 shows an example of a picture that is partitioned into 4 tiles,11 bricks, and 4 rectangular slices.

FIG. 4A shows an example of coding tree blocks (CTBs) crossing pictureborders when K=M, L<N.

FIG. 4B shows an example of CTBs crossing picture borders when K<M, L=N.

FIG. 4C shows an example of CTBs crossing picture borders when K<M, L<N.

FIG. 5 shows an example of encoder block diagram.

FIG. 6 is an illustration of picture samples and horizontal and verticalblock boundaries on the 8×8 grid, and the nonoverlapping blocks of the8×8 samples, which can be deblocked in parallel.

FIG. 7 shows examples of pixels involved in filter on/off decision andstrong/weak filter selection.

FIG. 8 shows four one-dimensional (1-D) directional patterns.

FIG. 9 shows examples of geometric adaptive loop filtering (GALF) filtershapes (left: 5×5 diamond, middle: 7×7 diamond, right: 9×9 diamond).

FIG. 10 shows relative coordinates for the 5×5 diamond filter support.

FIG. 11 shows examples of relative coordinates for the 5×5 diamondfilter support.

FIG. 12A shows an example arrangement for subsampled Laplaciancalculations.

FIG. 12B shows another example arrangement for subsampled Laplaciancalculations.

FIG. 12C shows another example arrangement for subsampled Laplaciancalculations.

FIG. 12D shows yet another example arrangement for subsampled Laplaciancalculations.

FIG. 13 shows an example of a loop filter line buffer requirement invirtual transport medium (VTM)-4.0 for Luma component.

FIG. 14 shows an example of a loop filter line buffer requirement inVTM-4.0 for Chroma component.

FIG. 15A shows an example of adaptive loop filter (ALF) blockclassification at virtual boundary when N=4.

FIG. 15B shows another example of ALF block classification at virtualboundary when N=4.

FIG. 16A illustrates an example of modified luma ALF filtering atvirtual boundary.

FIG. 16B illustrates another example of modified luma ALF filtering atvirtual boundary.

FIG. 16C illustrates yet another example of modified luma ALF filteringat virtual boundary.

FIG. 17A shows an example of modified chroma ALF filtering at virtualboundary.

FIG. 17B shows another example of modified chroma ALF filtering atvirtual boundary.

FIG. 18A shows an example of horizontal wrap around motion compensation.

FIG. 18B shows another example of horizontal wrap around motioncompensation.

FIG. 19 illustrates an example of a modified adaptive loop filter.

FIG. 20 shows example of processing CTUs in a video picture.

FIG. 21 shows an example of a modified adaptive loop filter boundary.

FIG. 22 is a block diagram of an example of a video processingapparatus.

FIG. 23 is a flowchart for an example method of video processing.

FIG. 24 shows an example of an image of a hybrid equi-angular cubemap(HEC) in 3×2 layout.

FIG. 25 shows an example of number of padded lines for samples of twokinds of boundaries.

FIG. 26 shows an example of processing of CTUs in a picture.

FIG. 27 shows another example of processing of CTUs in a picture.

FIG. 28 is a block diagram of an example video processing system inwhich disclosed embodiments may be implemented.

FIG. 29 is a flowchart representation of a method for video processingin accordance with the present embodiments.

DETAILED DESCRIPTION

Section headings are used in the present document to facilitate ease ofunderstanding and do not limit the embodiments disclosed in a section toonly that section. Furthermore, while certain embodiments are describedwith reference to Versatile Video Coding or other specific video codecs,the disclosed techniques are applicable to other video codingtechnologies also. Furthermore, while some embodiments describe videocoding steps in detail, it will be understood that corresponding stepsdecoding that undo the coding will be implemented by a decoder.Furthermore, the term video processing encompasses video coding orcompression, video decoding or decompression and video transcoding inwhich video pixels are represented from one compressed format intoanother compressed format or at a different compressed bitrate.

1. BRIEF SUMMARY

This document is related to video coding technologies. Specifically, itis related to picture/slice/tile/brick boundary and virtual boundarycoding especially for the non-linear adaptive loop filter. It may beapplied to the existing video coding standard like HEVC, or the standard(Versatile Video Coding) to be finalized. It may be also applicable tofuture video coding standards or video codec.

2. INITIAL DISCUSSION

Video coding standards have evolved primarily through the development ofthe well-known International Telecommunication Union (ITU)Telecommunication Standardization Sector (ITU-T) and InternationalOrganization for Standardization (ISO)/International ElectrotechnicalCommission (IEC) standards. The ITU-T produced H.261 and H.263, ISO/IECproduced MPEG-1 and MPEG-4 Visual, and the two organizations jointlyproduced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding(AVC) and H.265/HEVC standards. Since H.262, the video coding standardsare based on the hybrid video coding structure wherein temporalprediction plus transform coding are utilized. To explore the futurevideo coding technologies beyond HEVC, Joint Video Exploration Team(WET) was founded by VCEG and MPEG jointly in 2015. Since then, many newmethods have been adopted by JVET and put into the reference softwarenamed Joint Exploration Model (JEM). In April 2018, the JVET betweenVCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) was created to work onthe VVC standard targeting at 50% bitrate reduction compared to HEVC.

2.1 Color Space and Chroma Subsampling

Color space, also known as the color model (or color system), is anabstract mathematical model which simply describes the range of colorsas tuples of numbers, typically as 3 or 4 values or color components(e.g. red green blue (RGB)). Basically speaking, color space is anelaboration of the coordinate system and sub-space.

For video compression, the most frequently used color spaces are YCbCrand RGB.

YCbCr, Y′CbCr, or Y Pb/Cb Pr/Cr, also written as YCBCR or Y′CBCR, is afamily of color spaces used as a part of the color image pipeline invideo and digital photography systems. Y′ is the luma component and CBand CR are the blue-difference and red-difference chroma components. Y′(with prime) is distinguished from Y, which is luminance, meaning thatlight intensity is nonlinearly encoded based on gamma corrected RGBprimaries.

Chroma subsampling is the practice of encoding images by implementingless resolution for chroma information than for luma information, takingadvantage of the human visual system's lower acuity for colordifferences than for luminance.

2.1.1 Color Format 4:4:4

Each of the three Y′CbCr components have the same sample rate, thusthere is no chroma subsampling. This scheme is sometimes used inhigh-end film scanners and cinematic post production.

2.1.2 Color Format 4:2:2

The two chroma components are sampled at half the sample rate of luma:the horizontal chroma resolution is halved. This reduces the bandwidthof an uncompressed video signal by one-third with little to no visualdifference

2.1.3 Color Format 4:2:0

In 4:2:0, the horizontal sampling is doubled compared to 4:1:1, but asthe Cb and Cr channels are only sampled on each alternate line in thisscheme, the vertical resolution is halved. The data rate is thus thesame. Cb and Cr are each subsampled at a factor of 2 both horizontallyand vertically. There are three variants of 4:2:0 schemes, havingdifferent horizontal and vertical siting.

In MPEG-2, Ch and Cr are cosited horizontally. Cb and Cr are sitedbetween pixels in the vertical direction (sited interstitially).

In JPEG/JFIF, H.261, and MPEG-1, Cb and Cr are sited interstitially,halfway between alternate luma samples.

In 4:2:0 DV, Cb and Cr are co-sited in the horizontal direction. In thevertical direction, they are co-sited on alternating lines.

2.2 Various Video Units

A picture is divided into one or more tile rows and one or more tilecolumns. A tile is a sequence of CTUs that covers a rectangular regionof a picture.

A tile is divided into one or more bricks, each of which consisting of anumber of CTU rows within the tile.

A tile that is not partitioned into multiple bricks is also referred toas a brick. However, a brick that is a true subset of a tile is notreferred to as a tile.

A slice either contains a number of tiles of a picture or a number ofbricks of a tile.

Two modes of slices are supported, namely the raster-scan slice mode andthe rectangular slice mode. In the raster-scan slice mode, a slicecontains a sequence of tiles in a tile raster scan of a picture. In therectangular slice mode, a slice contains a number of bricks of a picturethat collectively form a rectangular region of the picture. The brickswithin a rectangular slice are in the order of brick raster scan of theslice.

FIG. 1 shows an example of raster-scan slice partitioning of a picture,where the picture is divided into 12 tiles and 3 raster-scan slices.

FIG. 2 shows an example of rectangular slice partitioning of a picture,where the picture is divided into 24 tiles (6 tile columns and 4 tilerows) and 9 rectangular slices.

FIG. 3 shows an example of a picture partitioned into tiles, bricks, andrectangular slices, where the picture is divided into 4 tiles (2 tilecolumns and 2 tile rows), 11 bricks (the top-left tile contains 1 brick,the top-right tile contains 5 bricks, the bottom-left tile contains 2bricks, and the bottom-right tile contain 3 bricks), and 4 rectangularslices.

2.2.1 CTU/CTB Sizes

In VVC, the CTU size, signalled in a sequence parameter set (SPS) by thesyntax element log 2_ctu_size_minus2, could be as small as 4×4.

7.3.2.3 Sequence Parameter Set RBSP Syntax

Descriptor seq_parameter_set_rbsp( ) {  sps_decoding_parameter_set_idu(4)  sps_video_parameter_set_id u(4)  sps_max_sub_layers_minus1 u(3) sps_reserved_zero_5bits u(5)  profile_tier_level(sps_max_sub_layers_minus1 )  gra_enabled_flag u(1) sps_seq_parameter_set_id ue(v)  chroma_format_idc ue(v)  if(chroma_format_idc = = 3 )   separate_colour_plane_flag u(1) pic_width_in_luma_samples ue(v)  pic_height_in_luma_samples ue(v) conformance_window_flag u(1)  if( conformance_window_flag ) {  conf_win_left_offset ue(v)   conf_win_right_offset ue(v)  conf_win_top_offset ue(v)   conf_win_bottom_offset ue(v)  } bit_depth_luma_minus8 ue(v)  bit_depth_chroma_minus8 ue(v) log2_max_pic_order_cnt_lsb_minus4 ue(v) sps_sub_layer_ordering_info_present_flag u(1)  for( i = (sps_sub_layer_ordering_info_present_flag ? 0 : sps_max_sub_layers_minus1);    i <= sps_max_sub_layers_minus1; i++ ) {  sps_max_dec_pic_buffering_minus1[ i ] ue(v)  sps_max_num_reorder_pics[ i ] ue(v)   sps_max_latency_increase_plus1[i ] ue(v)  }  long_term_ref_pics_flag u(1)  sps_idr_rpl_present_flagu(1)  rpl1_same_as_rpl0_flag u(1)  for( i = 0; i <!rpl1_same_as_rpl0_flag ? 2 : 1; i++ ) {   num_ref_pic_lists_in_sps[ i ]ue(v)   for( j = 0; j < num_ref_pic_lists_in_sps[ i ]; j++)   ref_pic_list_struct( i, j )  }  qtbtt_dual_tree_intra_flag u(1) log2_ctu_size_minus2 ue(v)  log2_min_luma_coding_block_size_minus2ue(v)  partition_constraints_override_enabled_flag u(1) sps_log2_diff_min_qt_min_cb_intra_slice_luma ue(v) sps_log2_diff_min_qt_min_cb_inter_slice ue(v) sps_max_mtt_hierarchy_depth_inter_slice ue(v) sps_max_mtt_hierarchy_depth_intra_slice_luma ue(v)  if(sps_max_mtt_hierarchy_depth_intra_slice_luma != 0 ) {  sps_log2_diff_max_bt_min_qt_intra_slice_luma ue(v)  sps_log2_diff_max_tt_min_qt_intra_slice_luma ue(v)  }  if(sps_max_mtt_hierarchy_depth_inter_slices != 0 ) {  sps_log2_diff_max_bt_min_qt_inter_slice ue(v)  sps_log2_diff_max_tt_min_qt_inter_slice ue(v)  }  if(qtbtt_dual_tree_intra_flag ) {  sps_log2_diff_min_qt_min_cb_intra_slice_chroma ue(v)  sps_max_mtt_hierarchy_depth_intra_slice_chroma ue(v)   if (sps_max_mtt_hierarchy_depth_intra_slice_chroma != 0 ) {   sps_log2_diff_max_bt_min_qt_intra_slice_chroma ue(v)   sps_log2_diff_max_tt_min_qt_intra_slice_chroma ue(v)   }  } ... rbsp_trailing_bits( ) }log 2_ctu_size_minus2 plus 2 specifies the luma coding tree block sizeof each CTU.log 2_min_luma_coding_block_size_minus2 plus 2 specifies the minimumluma coding block size.The variables CtbLog2SizeY, CtbSizeY, MinCbLog2SizeY, MinCbSizeY,MinTbLog2SizeY, MaxTbLog2SizeY, MinCbSizeY, MaxTbSizeY, PicWidthInCtbsY,PicHeightInCtbsY, PicSizeInCtbsY, PicWidthInMinCbsY, PicHeightInMinCbsY,PicSizeInMinCbsY, PicSizeInSamplesY, PicWidthInSamplesC andPicHeightInSamplesC may be derived as follows:CtbLog2SizeY=log 2_ctu_size_minus2+2  (7-9)CtbSizeY=1<<CtbLog2SizeY  (7-10)MinCbLog2SizeY=log 2_min_luma_coding_block_size_minus2+2  (7-11)MinCbSizeY=1<<MinCbLog2SizeY  (7-12)MinTbLog2SizeY=2  (7-13)MaxTbLog2SizeY=6  (7-14)MinCbSizeY=1<<MinTbLog2SizeY  (7-15)MaxTbSizeY=1<<MaxTbLog2SizeY  (7-16)PicWidthInCtbsY=Ceil(pic_width_in_luma_samples+CtbSizeY)  (7-17)PicHeightInCtbsY=Ceil(pic_height_in_luma_samples+CtbSizeY)  (7-18)PicSizeInCtbsY=PicWidthInCtbsY*PicHeightInCtbsY  (7-19)PicWidthInMinCbsY=pic_width_in_luma_samples/MinCbSizeY  (7-20)PicHeightInMinCbsY=pic_height_in_luma_samples/MinCbSizeY  (7-21)PicSizeInMinCbsY=PicWidthInMinCbsY*PicHeightInMinCbsY  (7-22)PicSizeInSamplesY=pic_width_in_luma_samples*pic_height_in_luma_samples  (7-23)PicWidthInSamplesC=pic_width_in_luma_samples/SubWidthC  (7-24)PicHeightInSamplesC=pic_height_in_luma_samples/SubHeightC  (7-25)

2.2.2 CTUs in a Picture

Suppose the CTB/largest coding unit (LCU) size indicated by M×N(typically M is equal to N, as defined in HEVC/VVC), and for a CTBlocated at picture (or tile or slice or other kinds of types, pictureborder is taken as an example) border, K×L samples are within pictureborder wherein either K<M or L<N. For those CTBs as depicted in FIG.4A-4C, the CTB size is still equal to M×N, however, the bottomboundary/right boundary of the CTB is outside the picture.

FIG. 4A shows CTBs crossing the bottom picture border. FIG. 4B showsCTBs crossing the right picture border. FIG. 4C shows CTBs crossing theright bottom picture border

FIGS. 4A-4C show examples of CTBs crossing picture borders, (a) K=M,L<N; (b) K<M, L=N; (c) K<M, L<N

2.3 Coding Flow of a Typical Video Codec

FIG. 5 shows an example of encoder block diagram of VVC, which containsthree in-loop filtering blocks: deblocking filter (DF), sample adaptiveoffset (SAO) and ALF. Unlike DF, which uses predefined filters, SAO andALF utilize the original samples of the current picture to reduce themean square errors between the original samples and the reconstructedsamples by adding an offset and by applying a finite impulse response(FIR) filter, respectively, with coded side information signaling theoffsets and filter coefficients. ALF is located at the last processingstage of each picture and can be regarded as a tool trying to catch andfix artifacts created by the previous stages.

2.4 Deblocking Filter (DB)

The Input of DB is the Reconstructed Samples Before In-Loop Filters.

The vertical edges in a picture are filtered first. Then the horizontaledges in a picture are filtered with samples modified by the verticaledge filtering process as input. The vertical and horizontal edges inthe CTBs of each CTU are processed separately on a coding unit basis.The vertical edges of the coding blocks in a coding unit are filteredstarting with the edge on the left-hand side of the coding blocksproceeding through the edges towards the right-hand side of the codingblocks in their geometrical order. The horizontal edges of the codingblocks in a coding unit are filtered starting with the edge on the topof the coding blocks proceeding through the edges towards the bottom ofthe coding blocks in their geometrical order.

FIG. 6 is an illustration of picture samples and horizontal and verticalblock boundaries on the 8×8 grid, and the nonoverlapping blocks of the8×8 samples, which can be deblocked in parallel.

2.4.1. Boundary Decision

Filtering is applied to 8×8 block boundaries. In addition, it must be atransform block boundary or a coding subblock boundary (e.g., due tousage of Affine motion prediction, ATMVP). For those which are not suchboundaries, filter is disabled.

2.4.1 Boundary Strength (bS) Calculation

For a transform block boundary/coding subblock boundary, if it islocated in the 8×8 grid, it may be filtered and the setting ofbS[xD_(i)][yD_(j)] (wherein [xD_(i)][yD_(j)] denotes the coordinate) forthis edge is defined in Table 1 and Table 2, respectively.

TABLE 1 Boundary strength (when SPS IBC is disabled) Priority ConditionsY U V 5 At least one of the adjacent blocks is intra 2 2 2 4 TU boundaryand at least one of the adjacent blocks has non- 1 1 1 zero transformcoefficients 3 Reference pictures or number of motion vectors (MVs) (1for 1 N/A N/A uni-prediction, 2 for bi-prediction) of the adjacentblocks are different 2 Absolute difference between the motion vectors ofsame 1 N/A N/A reference picture that belong to the adjacent blocks isgreater than or equal to one integer luma sample 1 Otherwise 0 0 0

TABLE 2 Boundary strength (when SPS IBC is enabled) Priority ConditionsY U V 8 At least one of the adjacent blocks is intra 2 2 2 7 TU boundaryand at least one of the adjacent blocks has non- 1 1 1 zero transformcoefficients 6 Prediction mode of adjacent blocks is different (e.g.,one is 1 IBC, one is inter) 5 Both IBC and absolute difference betweenthe motion vectors 1 N/A N/A that belong to the adjacent blocks isgreater than or equal to one integer luma sample 4 Reference pictures ornumber of MVs (1 for uni-prediction, 2 1 N/A N/A for bi-prediction) ofthe adjacent blocks are different 3 Absolute difference between themotion vectors of same 1 N/A N/A reference picture that belong to theadjacent blocks is greater than or equal to one integer luma sample 1Otherwise 0 0 0

2.4.3 Deblocking Decision for Luma Component

The deblocking decision process is described in this sub-section.

FIG. 7 shows examples of pixels involved in filter on/off decision andstrong/weak filter selection.

Wider-stronger luma filter is filters are used only if all theCondition1, Condition2 and Condition3 are TRUE.

The condition 1 is the “large block condition”. This condition detectswhether the samples at P-side and Q-side belong to large blocks, whichare represented by the variable bSidePisLargeBlk and bSideQisLargeBlkrespectively. The bSidePisLargeBlk and bSideQisLargeBlk are defined asfollows.

-   -   bSidePisLargeBlk=((edge type is vertical and p₀ belongs to CU        with width>=32)∥(edge type is horizontal and p₀ belongs to CU        with height>=32))?TRUE: FALSE    -   bSideQisLargeBlk=((edge type is vertical and q₀ belongs to CU        with width>=32)∥(edge type is horizontal and q₀ belongs to CU        with height>=32))?TRUE: FALSE

Based on bSidePisLargeBlk and bSideQisLargeBlk, the condition 1 isdefined as follows.Condition1=(bSidePisLargeBlk∥bSidePisLargeBlk)?TRUE:FALSE

Next, if Condition 1 is true, the condition 2 will be further checked.First, the following variables are derived:

-   -   dp0, dp3, dq0, dq3 are first derived as in HEVC    -   if (p side is greater than or equal to 32)        dp0=(dp0+Abs(p5₀−2*p4₀ +p3₀)+1)>>1        dp3=(dp3+Abs(p5₃−2*p4₃ +p3₃)+1)>>1    -   if (q side is greater than or equal to 32)        dq0=(dq0+Abs(q5₀−2*q4₀ +q3₀)+1)>>1        dq3=(dq3+Abs(q5₃−2*q4₃ +q3₃)+1)>>1        Condition2=(d<β)?TRUE:FALSE

where d=dp0+dq0+dp3+dq3.

If Condition1 and Condition2 are valid, whether any of the blocks usessub-blocks is further checked:

If (bSidePisLargeBlk)  {  If (mode block P == SUBBLOCKMODE)   Sp =5  else   Sp =7 } else  Sp = 3 If (bSideQisLargeBlk)  {  If (mode block Q== SUBBLOCKMODE)   Sq =5   else   Sq =7  } else  Sq = 3

Finally, if both the Condition 1 and Condition 2 are valid, the proposeddeblocking method will check the condition 3 (the large block strongfilter condition), which is defined as follows.

In the Condition3 StrongFilterCondition, the following variables arederived:

dpq is derived as in HEVC. sp₃ = Abs( p₃ − p₀ ), derived as in HEVC if(p side is greater than or equal to 32)  if(Sp==5)   sp₃ = ( sp₃ + Abs(p₅ − p₃ ) + 1) >> 1  else   sp₃ = ( sp₃ + Abs( p₇ − p₃ ) + 1) >> 1 sq₃ =Abs( q0 − q3 ), derived as in HEVC if (q side is greater than or equalto 32)  If(Sq==5)  sq₃ = ( sq₃ + Abs( q₅ − q₃ ) + 1) >> 1  else  sq₃ = (sq₃ + Abs( q₇ − q₃ ) + 1) >> 1

As in HEVC, StrongFilterCondition=(dpq is less than (β>>2), sp₃+sq₃ isless than (3*β>>5), and Abs(p₀−q₀) is less than (5*t_(C)+1)>>1)?TRUE:FALSE.

2.4.4 Stronger Deblocking Filter for Luma (Designed for Larger Blocks)

Bilinear filter is used when samples at either one side of a boundarybelong to a large block. A sample belonging to a large block is definedas when the width>=32 for a vertical edge, and when height>=32 for ahorizontal edge.

The bilinear filter is listed below.

Block boundary samples p_(i) for i=0 to Sp−1 and q_(i) for j=0 to Sq−1(pi and qi are the i-th sample within a row for filtering vertical edge,or the i-th sample within a column for filtering horizontal edge) inHEVC deblocking described above) are then replaced by linearinterpolation as follows:p _(i)′=(f _(i)*Middle_(s,t)+(64−f _(i))*P _(s)+32)>>6),clipped to p_(i) ±tcPD _(i)q _(j)′=(g _(j)*Middle_(s,t)+(64−g _(j))*Q _(s)+32)>>6),clipped to q_(j) ±tcPD _(j)where tcPD_(i) and tcPD₁ term is a position dependent clipping describedin Section 2.4.7 and g_(j), f_(i), Middle_(s,t), P_(s) and Q_(s) aregiven below:

2.4.5 Deblocking Control for Chroma

The chroma strong filters are used on both sides of the block boundary.Here, the chroma filter is selected when both sides of the chroma edgeare greater than or equal to 8 (chroma position), and the followingdecision with three conditions are satisfied: the first one is fordecision of boundary strength as well as large block. The proposedfilter can be applied when the block width or height which orthogonallycrosses the block edge is equal to or larger than 8 in chroma sampledomain. The second and third one is basically the same as for HEVC lumadeblocking decision, which are on/off decision and strong filterdecision, respectively.

In the first decision, boundary strength (bS) is modified for chromafiltering and the conditions are checked sequentially. If a condition issatisfied, then the remaining conditions with lower priorities areskipped.

Chroma deblocking is performed when bS is equal to 2, or bS is equal to1 when a large block boundary is detected.

The second and third condition is basically the same as HEVC luma strongfilter decision as follows.

In the second condition:

d is then derived as in HEVC luma deblocking.

The second condition will be TRUE when d is less than β.

In the third condition StrongFilterCondition is derived as follows:

dpq is derived as in HEVC.sp ₃=Abs(p ₃ −p ₀),derived as in HEVCsq ₃=Abs(q ₀ −q ₃),derived as in HEVC

As in HEVC design, StrongFilterCondition=(dpq is less than (β>>2),sp₃+sq₃ is less than (β>>3), and Abs(p₀−q₀) is less than(5*t_(C)+1)>>1), where β and t_(C) are threshold values.

2.4.6 Strong deblocking filter for chroma

The following strong deblocking filter for chroma is defined:p ₂′=(3*p ₃+2*p ₂ +p ₁ +p ₀ +q ₀+4)>>3p ₁′=(2*p ₃ +p ₂+2*p ₁ +p ₀ +q ₀ +q ₁+4)>>3p ₀′=(p ₃ +p ₂ +p ₁+2*p ₀ +q ₀ +q ₁ +q ₂+4)>>3

The proposed chroma filter performs deblocking on a 4×4 chroma samplegrid.

2.4.7 Position Dependent Clipping

The position dependent clipping tcPD is applied to the output samples ofthe luma filtering process involving strong and long filters that aremodifying 7, 5 and 3 samples at the boundary. Assuming quantizationerror distribution, it is proposed to increase clipping value forsamples which are expected to have higher quantization noise, thusexpected to have higher deviation of the reconstructed sample value fromthe true sample value.

For each P or Q boundary filtered with asymmetrical filter, depending onthe result of decision-making process in section 2.4.2, positiondependent threshold table is selected from two tables (e.g., Tc7 and Tc3tabulated below) that are provided to decoder as a side information:Tc7={6,5,4,3,2,1,1};Tc3={6,4,2};tcPD=(Sp==3)?Tc3:Tc7;tcQD=(Sq==3)?Tc3:Tc7;

For the P or Q boundaries being filtered with a short symmetricalfilter, position dependent threshold of lower magnitude is applied:Tc3={3,2,1};

Following defining the threshold, filtered p′_(i) and q′_(i) samplevalues are clipped according to tcP and tcQ clipping values:p″ _(i)=Clip3(p′ _(i) +tcP _(i) ,p′ _(i) −tcP _(i) p′ _(i));q″ _(j)=Clip3(q′ _(j) +tcQ _(j) ,q′ _(j) −tcQ _(j) ,q′ _(j));

where p′_(i) and q′_(i) are filtered sample values, p″_(i) and q″_(j)are output sample value after the clipping and tcP_(i) are clippingthresholds that are derived from the VVC tc parameter and tcPD and tcQD.The function Clip3 is a clipping function as it is specified in VVC.

2.4.8 Sub-Block Deblocking Adjustment

To enable parallel friendly deblocking using both long filters andsub-block deblocking the long filters is restricted to modify at most 5samples on a side that uses sub-block deblocking (AFFINE or ATMVP ordecoder-side motion vector refinement (DMVR)) as shown in the lumacontrol for long filters. Additionally, the sub-block deblocking isadjusted such that that sub-block boundaries on an 8×8 grid that areclose to a CU or an implicit transform unit (TU) boundary is restrictedto modify at most two samples on each side.

Following applies to sub-block boundaries that not are aligned with theCU boundary.

If (mode block Q == SUBBLOCKMODE && edge !=0) {  if (!(implicitTU &&(edge == (64 / 4))))   if (edge == 2 ∥ edge == (orthogonalLength − 2) ∥edge == (56 / 4) ∥   edge == (72 / 4))    Sp = Sq = 2;   else    Sp = Sq= 3;  else   Sp = Sq = bSideQisLargeBlk ? 5:3 }

Where edge equal to 0 corresponds to CU boundary, edge equal to 2 orequal to orthogonalLength-2 corresponds to sub-block boundary 8 samplesfrom a CU boundary etc. Where implicit TU is true if implicit split ofTU is used.

2.5 SAO

The input of SAO is the reconstructed samples after DB. The concept ofSAO is to reduce mean sample distortion of a region by first classifyingthe region samples into multiple categories with a selected classifier,obtaining an offset for each category, and then adding the offset toeach sample of the category, where the classifier index and the offsetsof the region are coded in the bitstream. In HEVC and VVC, the region(the unit for SAO parameters signaling) is defined to be a CTU.

Two SAO types that can satisfy the requirements of low complexity areadopted in HEVC. Those two types are edge offset (EO) and band offset(BO), which are discussed in further detail below. An index of an SAOtype is coded (which is in the range of [0,2]). For EO, the sampleclassification is based on comparison between current samples andneighboring samples according to 1-D directional patterns: horizontal,vertical, 135° diagonal, and 45° diagonal.

FIG. 8 shows four 1-D directional patterns for EO sample classification:horizontal (EO class=0), vertical (EO class=1), 135° diagonal (EOclass=2), and 45° diagonal (EO class=3)

For a given EO class, each sample inside the CTB is classified into oneof five categories. The current sample value, labeled as “c,” iscompared with its two neighbors along the selected 1-D pattern. Theclassification rules for each sample are summarized in Table 3.Categories 1 and 4 are associated with a local valley and a local peakalong the selected 1-D pattern, respectively. Categories 2 and 3 areassociated with concave and convex corners along the selected 1-Dpattern, respectively. If the current sample does not belong to EOcategories 1-4, then it is category 0 and SAO is not applied.

TABLE 3 Sample Classification Rules for Edge Offset Category Condition 1c < a and c < b 2 ( c < a && c == b) || (c == a && c < b) 3 ( c > a && c== b) || (c == a && c > b) 4 c > a && c > b 5 None of above

2.6 Geometry Transformation-based Adaptive Loop Filter

The input of DB is the reconstructed samples after DB and SAO. Thesample classification and filtering process are based on thereconstructed samples after DB and SAO.

In some embodiments, a geometry transformation-based adaptive loopfilter (GALF) with block-based filter adaption is applied. For the lumacomponent, one among 25 filters is selected for each 2×2 block, based onthe direction and activity of local gradients.

2.6.1 Filter Shape

In some embodiments, up to three diamond filter shapes (as shown in FIG.9 ) can be selected for the luma component. An index is signalled at thepicture level to indicate the filter shape used for the luma component.Each square represents a sample, and Ci (i being 0-6 (left), 0-12(middle), 0-20 (right)) denotes the coefficient to be applied to thesample. For chroma components in a picture, the 5×5 diamond shape isalways used.

2.6.1.1 Block Classification

Each 2×2 block is categorized into one out of 25 classes. Theclassification index C is derived based on its directionality D and aquantized value of activity Â, as follows:C=5D+Â.  (1)

To calculate D and Â, gradients of the horizontal, vertical and twodiagonal direction are first calculated using 1-D Laplacian:

$\begin{matrix}{{g_{v} = {\sum\limits_{k = {i - 2}}^{i + 3}{\sum\limits_{l = {j - 2}}^{j + 3}V_{k,l}}}},{V_{k,l} = {❘{{2{R\left( {k,l} \right)}} - {R\left( {k,{l - 1}} \right)} - {R\left( {k,{l + 1}} \right)}}❘}},} & (2)\end{matrix}$ $\begin{matrix}{{g_{h} = {\sum\limits_{k = {i - 2}}^{i + 3}{\sum\limits_{l = {j - 2}}^{j + 3}H_{k,l}}}},{H_{k,l} = {❘{{2{R\left( {k,l} \right)}} - {R\left( {{k - 1},l} \right)} - {R\left( {{k + 1},l} \right)}}❘}},} & (3)\end{matrix}$ $\begin{matrix}{{g_{d1} = {\sum\limits_{k = {i - 2}}^{i + 3}{\sum\limits_{j = {j - 3}}^{j + 3}{D1_{k,l}}}}},{{D1_{k,l}} = {❘{{2{R\left( {k,l} \right)}} - {R\left( {{k - 1},{l - 1}} \right)} - {R\left( {{k + 1},{l + 1}} \right)}}❘}}} & (4)\end{matrix}$ $\begin{matrix}{{g_{d2} = {\sum\limits_{k = {i - 2}}^{i + 3}{\sum\limits_{j = {j - 2}}^{j + 3}{D2_{k,l}}}}},{{D2_{k,l}} = {❘{{2{R\left( {k,l} \right)}} - {R\left( {{k - 1},{l + 1}} \right)} - {R\left( {{k + 1},{l - 1}} \right)}}❘}}} & (5)\end{matrix}$

Indices i and j refer to the coordinates of the upper left sample in the2×2 block and R(i,j) indicates a reconstructed sample at coordinate(i,j).

Then D maximum and minimum values of the gradients of horizontal andvertical directions are set as:g _(h,v) ^(max)=max(g _(h) ,g _(v)),g _(h,v) ^(min)=min(g _(h) ,g_(v)),  (6)

and the maximum and minimum values of the gradient of two diagonaldirections are set as:g _(d0,d1) ^(max)=max(g _(d0) ,g _(d1)),g _(d0,d1)=min(g _(d0) ,g_(d1)),  (7)

To derive the value of the directionality D, these values are comparedagainst each other and with two thresholds t₁ and t₂:

Step 1. If both g_(h,v) ^(max)≤t₁·g_(h,v) ^(min) and g_(d0,d1)^(max)≤t₁·g_(d0,d1) ^(min) are true, D is set to 0.

Step 2. If g_(h,v) ^(max)/g_(h,v) ^(min)>g_(d0,d1) ^(max)/g_(d0,d1)^(min), continue from Step 3; otherwise continue from Step 4.

Step 3. If g_(h,v) ^(max)>t₂·g_(h,v) ^(min), D is set to 2; otherwise Dis set to 1.

Step 4. If g_(d0,d1)>t₂·g_(d0,d1) ^(min), D is set to 4; otherwise D isset to 3.

The activity value A is calculated as:

$\begin{matrix}{A = {\sum\limits_{k = {i - 2}}^{i + 3}{\sum\limits_{l = {j - 2}}^{j + 3}{\left( {V_{k,l} + H_{k,l}} \right).}}}} & (8)\end{matrix}$

A is further quantized to the range of 0 to 4, inclusively, and thequantized value is denoted as Â.

For both chroma components in a picture, no classification method isapplied, e.g. a single set of ALF coefficients is applied for eachchroma component.

2.6.1.2 Geometric Transformations of Filter Coefficients

FIG. 10 shows relative coordinator for the 5×5 diamond filter support:Left: Diagonal Center: Vertical flip, Right: Rotation.

Before filtering each 2×2 block, geometric transformations such asrotation or diagonal and vertical flipping are applied to the filtercoefficients f(k, l), which is associated with the coordinate (k, l),depending on gradient values calculated for that block. This isequivalent to applying these transformations to the samples in thefilter support region. The idea is to make different blocks to which ALFis applied more similar by aligning their directionality.

Three geometric transformations, including diagonal, vertical flip androtation are introduced:Diagonal: f _(D)(k,l)=f(l,k),Vertical flip: f _(v)(k,l)=f(k,K−l−1),Rotation: f _(R)(k,l)=f(K−l−1,k).  (9)

where K is the size of the filter and 0≤k, l≤K−1 are coefficientscoordinates, such that location (0,0) is at the upper left corner andlocation (K−1, K−1) is at the lower right corner. The transformationsare applied to the filter coefficients f(k, l) depending on gradientvalues calculated for that block. The relationship between thetransformation and the four gradients of the four directions aresummarized in Table 4. FIG. 9 shows the transformed coefficients foreach position based on the 5×5 diamond.

TABLE 4 Mapping of the gradient calculated for one block and thetransformations Gradient values Transformation g_(d2) < g_(d1) and g_(h)< g_(v) No transformation g_(d2) < g_(d1) and g_(v) < g_(h) Diagonalg_(d1) < g_(d2) and g_(h) < g_(v) Vertical flip g_(d1) < g_(d2) andg_(v) < g_(h) Rotation

2.6.1.3 Filter Parameters Signalling

In some embodiments, GALF filter parameters are signalled for the firstCTU, e.g., after the slice header and before the SAO parameters of thefirst CTU. Up to 25 sets of luma filter coefficients could be signalled.To reduce bits overhead, filter coefficients of different classificationcan be merged. Also, the GALF coefficients of reference pictures arestored and allowed to be reused as GALF coefficients of a currentpicture. The current picture may choose to use GALF coefficients storedfor the reference pictures and bypass the GALF coefficients signalling.In this case, only an index to one of the reference pictures issignalled, and the stored GALF coefficients of the indicated referencepicture are inherited for the current picture.

To support GALF temporal prediction, a candidate list of GALF filtersets is maintained. At the beginning of decoding a new sequence, thecandidate list is empty. After decoding one picture, the correspondingset of filters may be added to the candidate list. Once the size of thecandidate list reaches the maximum allowed value (e.g., 6), a new set offilters overwrites the oldest set in decoding order, and that is,first-in-first-out (FIFO) rule is applied to update the candidate list.To avoid duplications, a set could only be added to the list when thecorresponding picture doesn't use GALF temporal prediction. To supporttemporal scalability, there are multiple candidate lists of filter sets,and each candidate list is associated with a temporal layer. Morespecifically, each array assigned by temporal layer index (TempIdx) maycompose filter sets of previously decoded pictures with equal to lowerTempIdx. For example, the k-th array is assigned to be associated withTempIdx equal to k, and it only contains filter sets from pictures withTempIdx smaller than or equal to k. After coding a certain picture, thefilter sets associated with the picture will be used to update thosearrays associated with equal or higher TempIdx.

Temporal prediction of GALF coefficients is used for inter coded framesto minimize signalling overhead. For intra frames, temporal predictionis not available, and a set of 16 fixed filters is assigned to eachclass. To indicate the usage of the fixed filter, a flag for each classis signalled and if required, the index of the chosen fixed filter. Evenwhen the fixed filter is selected for a given class, the coefficients ofthe adaptive filter f(k, l) can still be sent for this class in whichcase the coefficients of the filter which will be applied to thereconstructed image are sum of both sets of coefficients.

The filtering process of luma component can controlled at CU level. Aflag is signalled to indicate whether GALF is applied to the lumacomponent of a CU. For chroma component, whether GALF is applied or notis indicated at picture level only.

2.6.1.4 Filtering Process

At decoder side, when GALF is enabled for a block, each sample R(i, j)within the block is filtered, resulting in sample value R′(i, j) asshown below, where L denotes filter length, f_(m,n) represents filtercoefficient, and f(k, l) denotes the decoded filter coefficients.R′(i,j)=Σ_(k=−L/2) ^(L/2)Σ_(l=−L/2) ^(L/2) f(k,l)×R(i+k,j+l)  (10)

FIG. 11 shows an example of relative coordinates used for 5×5 diamondfilter support supposing the current sample's coordinate (i, j) to be(0, 0). Samples in different coordinates filled with the same color aremultiplied with the same filter coefficients.

2.7 Geometry Transformation-based Adaptive Loop Filter (GALF)

2.7.1 Example GALF

In some embodiments, the filtering process of the Adaptive Loop Filter,is performed as follows:O(x,y)=Σ_((i,j)) w(i,j)·I(x+y+j),  (11)

where samples I(x+i, y+j) are input samples, O(x, y) is the filteredoutput sample (e.g. filter result), and w(i,j) denotes the filtercoefficients. In practice, in VTM4.0 it is implemented using integerarithmetic for fixed point precision computations:

$\begin{matrix}{{{{{O\left( {x,y} \right)} = \left( {{{\sum}_{i = {- \frac{L}{2}}}^{\frac{L}{2}}{\sum}_{j = {- \frac{L}{2}}}^{\frac{L}{2}}{{w\left( {i,j} \right)} \cdot {I\left( {{x + i},{y + j}} \right)}}} + 64} \right)}}7},} & (12)\end{matrix}$

where L denotes the filter length, and where w(i,j) are the filtercoefficients in fixed point precision.

The current design of GALF in VVC has the following major changes:

(1) The adaptive filter shape is removed. Only 7×7 filter shape isallowed for luma component and 5×5 filter shape is allowed for chromacomponent.

(2) Signaling of ALF parameters in removed from slice/picture level toCTU level.

(3) Calculation of class index is performed in 4×4 level instead of 2×2.In addition, in some embodiments, sub-sampled Laplacian calculationmethod for ALF classification is utilized. More specifically, there isno need to calculate the horizontal/vertical/45 diagonal/135 degreegradients for each sample within one block. Instead, 1:2 subsampling isutilized.

FIG. 12A-12D show Subsampled Laplacian calculation for CE2.6.2. FIG. 12Aillustrates subsampled positions for vertical gradient, FIG. 12illustrates subsampled positions for horizontal gradient, FIG. 12Cillustrates subsampled positions for diagonal gradient, and FIG. 12Dillustrates subsampled positions for diagonal gradient.

2.8 Non-Linear ALF

2.8.1 Filtering Reformulation

Equation (11) can be reformulated, without coding efficiency impact, inthe following expression:O(x,y)=I(x,y)+Σ_((i,j)≠(0,0)) w(i,j)·(I(x+i,y+j)−I(x,y)),  (13)where w(i,j) are the same filter coefficients as in equation (11)[excepted w(0, 0) which is equal to 1 in equation (13) while it is equalto 1−Σ_((i,j)≠(0,0))w(i,j) in equation (11)].

Using this above filter formula of (13), VVC introduces thenon-linearity to make ALF more efficient by using a simple clippingfunction to reduce the impact of neighbor sample values (I(x+i, y+j))when they are too different with the current sample value (I(x, y))being filtered.

More specifically, the ALF filter is modified as follows:O′(x,y)=I(x,y)+Σ_((i,j)≠(0,0)) w(i,j)·K(I(x+i,y+j)−I(x,y),k(i,j)),  (14)

where K(d, b)=min(b, max(−b, d)) is the clipping function, and k(i, j)are clipping parameters, which depends on the (i,j) filter coefficient.The encoder performs the optimization to find the best k(i, j).

In some embodiments, the clipping parameters k(i, j) are specified foreach ALF filter, one clipping value is signalled per filter coefficient.It means that up to 12 clipping values can be signalled in the bitstreamper Luma filter and up to 6 clipping values for the Chroma filter.

In order to limit the signaling cost and the encoder complexity, only 4fixed values which are the same for INTER and INTRA slices are used.

Because the variance of the local differences is often higher for Lumathan for Chroma, two different sets for the Luma and Chroma filters areapplied. The maximum sample value (here 1024 for 10 bits bit-depth) ineach set is also introduced, so that clipping can be disabled if it isnot necessary.

The sets of clipping values used in some embodiments are provided in theTable 5. The 4 values have been selected by roughly equally splitting,in the logarithmic domain, the full range of the sample values (coded on10 bits) for Luma, and the range from 4 to 1024 for Chroma.

More precisely, the Luma table of clipping values have been obtained bythe following formula:

$\begin{matrix}{\left. \left. {{AlfClip}_{L}\left\{ {{{{round}\left( \left( (M)^{\frac{1}{N}} \right)^{N - n + 1} \right)}{for}n} \in {1\ldots N}} \right.} \right\rbrack \right\},{{{with}M} = {{2^{10}{and}N} = 4.}}} & (15)\end{matrix}$

Similarly, the Chroma tables of clipping values is obtained according tothe following formula:

$\begin{matrix}{\left. \left. {{AlfClip}_{C} = \left\{ {{{{round}\left( {A \cdot \left( \left( \frac{M}{A} \right)^{\frac{1}{N - 1}} \right)^{N - n}} \right)}{for}n} \in {1\ldots N}} \right.} \right\rbrack \right\},{{{with}M} = 2^{10}},{N = {{4{and}A} = 4.}}} & (16)\end{matrix}$

TABLE 5 Authorized clipping values INTRA/INTER tile group LUMA { 1024,181, 32, 6 } CHROMA { 1024, 161, 25, 4 }

The selected clipping values are coded in the “alf_data” syntax elementby using a Golomb encoding scheme corresponding to the index of theclipping value in the above Table 5. This encoding scheme is the same asthe encoding scheme for the filter index.

2.9 Virtual Boundary

In hardware and embedded software, picture-based processing ispractically unacceptable due to its high picture buffer requirement.Using on-chip picture buffers is very expensive and using off-chippicture buffers significantly increases external memory access, powerconsumption, and data access latency. Therefore, DF, SAO, and ALF willbe changed from picture-based to LCU-based decoding in real products.When LCU-based processing is used for DF, SAO, and ALF, the entiredecoding process can be done LCU by LCU in a raster scan with anLCU-pipelining fashion for parallel processing of multiple LCUs. In thiscase, line buffers are required for DF, SAO, and ALF because processingone LCU row requires pixels from the above LCU row. If off-chip linebuffers (e.g. DRAM) are used, the external memory bandwidth and powerconsumption will be increased; if on-chip line buffers (e.g. SRAM) areused, the chip area will be increased. Therefore, although line buffersare already much smaller than picture buffers, it is still desirable toreduce line buffers.

In some embodiments, as shown in FIG. 13 , the total number of linebuffers required is 11.25 lines for the Luma component. The explanationof the line buffer requirement is as follows: The deblocking ofhorizontal edge overlapping with CTU edge cannot be performed as thedecisions and filtering require lines K, L, M, M from the first CTU andLines O, P from the bottom CTU. Therefore, the deblocking of thehorizontal edges overlapping with the CTU boundary is postponed untilthe lower CTU comes. Therefore, for the lines K, L, M, N reconstructedluma samples have to be stored in the line buffer (4 lines). Then theSAO filtering can be performed for lines A till J. The line J can be SAOfiltered as deblocking does not change the samples in line K. For SAOfiltering of line K, the edge offset classification decision is onlystored in the line buffer (which is 0.25 Luma lines). The ALF filteringcan only be performed for lines A-F. As shown in FIG. 13 , the ALFclassification is performed for each 4×4 block. Each 4×4 blockclassification needs an activity window of size 8×8 which in turn needsa 9×9 window to compute the 1d Laplacian to determine the gradient.

Therefore, for the block classification of the 4×4 block overlappingwith lines G, H, I, J needs, SAO filtered samples below the Virtualboundary. In addition, the SAO filtered samples of lines D, E, F arerequired for ALF classification. Moreover, the ALF filtering of Line Gneeds three SAO filtered lines D, E, F from above lines. Therefore, thetotal line buffer requirement is as follows:

-   -   Lines K-N (Horizontal DF pixels): 4 lines    -   Lines D-J (SAO filtered pixels): 7 lines    -   SAO Edge offset classifier values between line J and line K:        0.25 line

Therefore, the total number of luma lines required is 7+4+0.25=11.25.

Similarly, the line buffer requirement of the Chroma component isillustrated in FIG. 14 . The line buffer requirement for Chromacomponent is evaluated to be 6.25 lines.

In order to eliminate the line buffer requirements of SAO and ALF, theconcept of virtual boundary (VB) is introduced in the latest VVC. Asshown in FIG. 13 , VBs are upward shifted horizontal LCU boundaries by Npixels. For each LCU, SAO and ALF can process pixels above the VB beforethe lower LCU comes but cannot process pixels below the VB until thelower LCU comes, which is caused by DF. With consideration of thehardware implementation cost, the space between the proposed VB and thehorizontal LCU boundary is set as four pixels for luma (e.g. N=4 in FIG.13 ) and two pixels for chroma (e.g. N=2 in FIG. 9 ).

2.9.1 Modified ALF Block Classification when VB Size N is 4

FIGS. 15A-15B depict modified block classification for the case when thevirtual boundary is 4 lines above the CTU boundary (N=4). As depicted inFIG. 15A, for the 4×4 block starting at line G, the block classificationonly uses the lines E till J. However Laplacian gradient calculation forthe samples belonging to line J requires one more line below (line K).Therefore, line K is padded with line J.

Similarly, as depicted in FIG. 15B, for the 4×4 block starting at lineK, the block classification only uses the lines K till P. HoweverLaplacian gradient calculation for the samples belonging to line Krequire one more line above (line J). Therefore, line J is padded withline K.

2.9.2 Two-Side Padding for Samples Cross Virtual Boundaries

As depicted in FIGS. 16A-16C, truncated version of the filters is usedfor filtering of the luma samples belonging to the lines close to thevirtual boundaries. Taking FIG. 16A for example, when filtering the lineM as denoted in FIG. 13 , e.g., the center sample of the 7×7 diamondsupport is in the line M. it requires to access one line above the VB(denoted by bold line). In this case, the samples above the VB is copiedfrom the right below sample below the VB, such as the P0 sample in thesolid line is copied to the above dash position. Symmetrically, P3sample in the solid line is also copied to the right below dashedposition even the sample for that position is available. The copiedsamples are only used in the luma filtering process.

The padding method used for ALF virtual boundaries may be denoted as‘Two-side Padding’ wherein if one sample located at (i, j) (e.g., theP0A with dash line in FIG. 16B) is padded, then the corresponding samplelocated at (m, n) (e.g., the P3B with dash line in FIG. 16B) which sharethe same filter coefficient is also padded even the sample is available,as depicted in FIGS. 16A-16C and FIGS. 17A-17B. In FIGS. 16A-16C, 7×7diamond filter support, center is the current sample to be filtered.FIG. 16A shows one required line above/below VB need to be padded. FIG.16B shows 2 required lines above/below VB need to be padded. FIG. 16Cshows 3 required lines above/below VB need to be padded.

Similarly, as depicted in FIGS. 17A-17B, the two-side padding method isalso used for chroma ALF filtering. FIGS. 17A-17B show modified chromaALF filtering at virtual boundary (5×5 diamond filter support, center isthe current sample to be filtered). FIG. 17A shows 1 required linesabove/below VB need to be padded. FIG. 17B shows 2 required linesabove/below VB need to be padded.

2.9.3 Alternative Way for Implementation of the Two-Side Padding whenNon-Linear ALF is Disabled

When the non-linear ALF is disabled for a CTB, e.g., the clippingparameters k(i,j) in equation (14) are equal to (1<<Bitdepth), thepadding process could be replaced by modifying the filter coefficients(a.k.a modified-coeff based ALF, MALF). For example, when filteringsamples in line L/I, the filter coefficient c5 is modified to c5′, inthis case, there is no need to copy the luma samples from the solid P0Ato dashed P0A and solid P3B to dashed P3B FIG. 18A. In this case, thetwo-side padding and MALF will generate the same results, assuming thecurrent sample to be filtered is located at (x, y).c5·K(I(x−1,y−1)−I(x,y),k(−1,−1))+c1·K(x−1,y−2)−I(x,y),k(−1,−2))=(c5+c1)·K(I(x−1,y−1)−I(x,y),k(−1,−1))  (17)since K(d, b)=d and I(x−1, y−1)=I(x−1, y−2) due to padding.

However, when the non-linear ALF is enabled, MALF and two-side paddingmay generate different filtered results, since the non-linear parametersare associated with each coefficient, such as for filter coefficients c5and c1, the clipping parameters are different. Therefore,c5·K(/(x−1,y−1)−/(x,y),k(−1,−1))+c1·K(I(x−1,y−2)−I(x,y),k(−1,−2))!=(c5+c1)·K(I(x−1,y−1)−I(x,y),k(−1,−1))  (18)

since K(d, b)!=d, even I(x−1, y−1)=I(x−1, y−2) due to padding.

2.10 Specification on ALF Filtering

Newly added parts are indicated in bold italicized text. The deletedparts are indicated using [[ ]].

7.3.2.4 Picture Parameter Set RBSP Syntax

Descriptor pic_parameter_set_rbsp( ) {  pps_pic_parameter_set_id ue(v) pps_seq_parameter_set_id ue(v)  output_flag_present_flag u(1) single_tile_in_pic_flag u(1)  if( !single_tile_in_pic_flag ) {  uniform_tile_spacing_flag u(1)   if( uniform_tile_spacing_flag ) {   tile_cols_width_minus1 ue(v)    tile_rows_height_minus1 ue(v)   }else {    num_tile_columns_minus1 ue(v)    num_tile_rows_minus1 ue(v)   for( i = 0; i < num_tile_columns_minus1; i++ )    tile_column_width_minus1[ i ] ue(v)    for( i = 0; i <num_tile_rows_minus1; i++ )     tile_row_height_minus1[ i ] ue(v)   }  brick_splitting_present_flag u(1)   for( i = 0;brick_splitting_present_flag && i < NumTilesInPic; i++ ) {   brick_split_flag[ i ] u(1)    if( brick_split_flag[ i ] ) {    uniform_brick_spacing_flag[ i ] u(1)     if(uniform_brick_spacing_flag[ i ] )      brick_height_minus1[ i ] ue(v)    else {      num_brick_rows_minus1[ i ] ue(v)      for( j = 0; j <num_brick_rows_minus1[ i ]; j++ )       brick_row_height_minus1[ i ][ j] ue(v)     }    }   }   single_brick_per_slice_flag u(1)   if(!single_brick_per_slice_flag )    rect_slice_flag u(1)   if(rect_slice_flag && !single_brick_per_slice_flag ) {   num_slices_in_pic_minus1 ue(v)    for( i = 0; i <=num_slices_in_pic_minus1; i++ ) {     if( i > 0 )     top_left_brick_idx[ i ] u(v)     bottom_right_brick_idx_delta[ i ]u(v)    }   }   loop_filter_across_bricks_enabled_flag u(1)   if(loop_filter_across_bricks_enabled_flag )   loop_filter_across_slices_enabled_flag u(1)   }  if( rect_slice_flag) {   signalled_slice_id_flag u(1)   if( signalled_slice_id_flag ) {   signalled_slice_id_length_minus1 ue(v)    for( i = 0; i <=num_slices_in_pic_minus1; i++ )     slice_id[ i ] u(v)   }  } entropy_coding_sync_enabled_flag u(1)  cabac_init_present_flag u(1) for( i = 0; i < 2; i++ )   num_ref_idx_default_active_minus1[ i ] ue(v) rpl1_idx_present_flag u(1)  init_qp_minus26 se(v) transform_skip_enabled_flag u(1)  if( transform_skip_enabled_flag )  log2_transform_skip_max_size_minus2 ue(v)  cu_qp_delta_enabled_flagu(1)  if( cu_qp_delta_enabled_flag )   cu_qp_delta_subdiv ue(v) pps_cb_qp_offset se(v)  pps_cr_qp_offset se(v) pps_joint_cbcr_qp_offset se(v) pps_slice_chroma_qp_offsets_present_flag u(1)  weighted_pred_flag u(1) weighted_bipred_flag u(1)  deblocking_filter_control_present_flag u(1) if( deblocking_filter_control_present_flag ) {  deblocking_filter_override_enabled_flag u(1)  pps_deblocking_filter_disabled_flag u(1)   if(!pps_deblocking_filter_disabled_flag ) {    pps_beta_offset_div2 se(v)   pps_tc_offset_div2 se(v)   }  } pps_loop_filter_across_virtual_boundaries_disabled_flag u(1)  if(pps_loop_filter_across_virtual_boundaries_disabled_flag ) {  pps_num_ver_virtual_boundaries u(2)   for( i = 0; i <pps_num_ver_virtual_boundaries; i++ )    pps_virtual_boundaries_pos_x[ i] u(v)   pps_num_hor_virtual_boundaries u(2)   for( i = 0; i <pps_num_hor_virtual_boundaries; i++ )    pps_virtual_boundaries_pos_y[ i] u(v)  }  pps_extension_flag u(1)  if( pps_extension_flag )   while(more_rbsp_data( ) )    pps_extension_data_flag u(1)  rbsp_trailing_bits() }

loop_filter_across_bricks_enabled_flag equal to 1 specifies that in-loopfiltering operations may be performed across brick boundaries inpictures referring to the picture parameter set (PPS).loop_filter_across_bricks_enabled_flag equal to 0 specifies that in-loopfiltering operations are not performed across brick boundaries inpictures referring to the PPS. The in-loop filtering operations includethe deblocking filter, sample adaptive offset filter, and adaptive loopfilter operations. When not present, the value ofloop_filter_across_bricks_enabled_flag is inferred to be equal to 1.

loop_filter_across_slices_enabled_flag equal to 1 specifies that in-loopfiltering operations may be performed across slice boundaries inpictures referring to the PPS. loop_filter_across_slice_enabled_flagequal to 0 specifies that in-loop filtering operations are not performedacross slice boundaries in pictures referring to the PPS. The in-loopfiltering operations include the deblocking filter, sample adaptiveoffset filter, and adaptive loop filter operations. When not present,the value of loop_filter_across_slices_enabled_flag is inferred to beequal to 0.

pps_loop_filter_across_virtual_boundaries_disabled_flag equal to 1specifies that the in-loop filtering operations are disabled across thevirtual boundaries in pictures referring to the PPS.pps_loop_filter_across_virtual_boundaries_disabled_flag equal to 0specifies that no such disabling of in-loop filtering operations isapplied in pictures referring to the PPS. The in-loop filteringoperations include the deblocking filter, sample adaptive offset filter,and adaptive loop filter operations. When not present, the value ofpps_loop_filter_across_virtual_boundaries_disabled_flag is inferred tobe equal to 0.

pps_num_ver_virtual_boundaries specifies the number ofpps_virtual_boundaries_pos_x[i] syntax elements that are present in thePPS. When pps_num_ver_virtual_boundaries is not present, it is inferredto be equal to 0.

8.8.5.2 Coding Tree Block Filtering Process for Luma Samples

Inputs of this process are:

-   -   a reconstructed luma picture sample array recPicture_(L) prior        to the adaptive loop filtering process,    -   a filtered reconstructed luma picture sample array        alfPicture_(L),    -   a luma location (xCtb, yCtb) specifying the top-left sample of        the current luma coding tree block relative to the top left        sample of the current picture.

An output of this process is the modified filtered reconstructed lumapicture sample array alfPicture_(L).

The derivation process for filter index clause 8.8.5.3 is invoked withthe location (xCtb, yCtb) and the reconstructed luma picture samplearray recPicture_(L) as inputs, and filtIdx[x][y] and transposeIdx[x][y]with x, y=0 . . . CtbSizeY−1 as outputs.

For the derivation of the filtered reconstructed luma samplesalfPicture_(L)[x][y], each reconstructed luma sample inside the currentluma coding tree block recPicture_(L)[x][y] is filtered as follows withx, y=0 . . . CtbSizeY−1:

-   -   The array of luma filter coefficients f[j] and the array of luma        clipping values c[j] corresponding to the filter specified by        filtIdx[x][y] is derived as follows with j=0 . . . 11:        -   If AlfCtbFiltSetIdxY[xCtb>>Log2CtbSize][yCtb>>Log2CtbSize]            is less than 16, the following applies:            i=AlfCtbFiltSetIdxY[xCtb>>Log2CtbSize][yCtb>>Log2CtbSize]  (8-1172)            f[j]=AlfFixFiltCoeff[AlfClassToFiltMap[i][filtidx]][j]  (8-1173)            c[j]=2^(BitdepthY)  (8-1174)        -   Otherwise            (AlfCtbFiltSetIdxY[xCtb>>Log2CtbSize][yCtb>>Log2CtbSize] is            greater than or equal to 16, the following applies:            i=slice_alf_aps_id_luma[AlfCtbFiltSetIdxY[xCtb>>Log2CtbSize][yCtb>>Log2CtbSize]−16]  (8-1175)            f[j]=AlfCoeff_(L) [i][filtIdx[x][y]][j]   (8-1176)            c[j]=AlfClip_(L) [i][filtIdx[x][y]][j]   (8-1177)

    -   The luma filter coefficients and clipping values index idx are        derived depending on transposeIdx[x][y] as follows:        -   If transposeIndex[x][y] is equal to 1, the following            applies:            idx[ ]={9,4,10,8,1,5,11,7,3,0,2,6}   (8-1178)        -   Otherwise, if transposeIndex[x][y] is equal to 2, the            following applies:            idx[ ]={0,3,2,1,8,7,6,5,4,9,10,11}   (8-1179)        -   Otherwise, if transposeIndex[x][y] is equal to 3, the            following applies:            idx[ ]={9,8,10,4,3,7,11,5,1,0,2,6}   (8-1180)        -   Otherwise, the following applies:            idx[ ]={0,1,2,3,4,5,6,7,8,9,10,11}   (8-1181)

    -   The locations (h_(x+i), v_(y+j)) for each of the corresponding        luma samples (x, y) inside the given array recPicture of luma        samples with i, j=−3 . . . 3 may be derived as follows:        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and xCtb+x−PpsVirtualBoundariesPosX[n] is            greater than or equal to 0 and less than 3 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(PpsVirtualBoundariesPosX[n],pic_width_in_luma_samples−1,xCtb+x+i)  (8-1182)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosX[n]−xCtb−x is greater            than 0 and less than 4 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]−1,xCtb+x+i)  (8-1183)        -   Otherwise, the following applies:            h            _(x+i)=Clip3(0,pic_width_in_luma_samples−1,xCtb+x+i)  (8-1184)        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and yCtb+y−PpsVirtualBoundariesPosY[n] is            greater than or equal to 0 and less than 3 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(PpsVirtualBoundariesPosY[n],pic_height_in_luma_samples−1,yCtb+y+j)  (8-1185)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosY[n]−yCtb−y is greater            than 0 and less than 4 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n]−1,yCtb+y+j)  (8-1186)        -   Otherwise, the following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples−1,yCtb+y+j)  (8-1187)

    -   -   -   

            -   

            -   

            -   

        -   The reconstructed sample offsets r1, r2 and r3 are specified            in Table 8-22 according to the horizontal luma sample            position y and apply VirtualBoundary.

        -   The variable curr may be derived as follows:            curr=recPicture_(L) [h _(x) ,v _(y)]  (8-1188)

        -   The variable sum may be derived as follows:            sum=f[idx[0]]*(Clip3(−c[idx[0]],c[idx[0]],recPicture_(L) [h            _(x) ,v            _(y+r3)]−curr)+Clip3(−c[idx[0]],c[idx[0]],recPicture_(L) [h            _(x) ,v            _(y−r3)]−curr))+f[idx[1]]*(Clip3(−c[idx[1]],c[idx[1]],recPicture_(L)            [h _(x+1) ,v            _(y+r2)]−curr)+Clip3(−c[idx[1]],c[idx[1]],recPicture_(L) [h            _(x−1) ,v            _(y−r2)]−curr))+f[idx[2]]*(Clip3(−c[idx[2]],c[idx[2]],recPicture_(L)            [h _(x) ,v            _(y+r2)]−curr)+Clip3(−c[idx[2]],c[idx[2]],recPicture_(L) [h            _(x) ,v            _(y−r2)]−curr))+f[idx[3]]*(Clip3(−c[idx[3]],c[idx[3]],recPicture_(L)            [h _(x−1) ,v            _(y+r2)]−curr)+Clip3(−c[idx[3]],c[idx[3]],recPicture_(L) [h            _(x+1) ,v            _(y−r2)]−curr))+f[idx[4]]*(Clip3(−c[idx[4]],c[idx[4]],recPicture_(L)            [h _(x+2) ,v            _(y+r1)]−curr)+Clip3(−c[idx[4]],c[idx[4]],recPicture_(L) [h            _(x−2) ,v            _(y−r1)]−curr))+f[idx[5]]*(Clip3(−c[idx[5]],c[idx[5]],recPicture_(L)            [h _(x+1) ,v            _(y+r1)]−curr)+Clip3(−c[idx[5]],c[idx[5]],recPicture_(L) [h            _(x−1) ,v            _(y−r1)]−curr))+f[idx[6]]*(Clip3(−c[idx[6]],c[idx[6]],recPicture_(L)            [h _(x) ,v            _(y+r1)]−curr)+Clip3(−c[idx[6]],c[idx[6]],recPicture_(L) [h            _(x) ,v            _(y−r1)]−curr))+f[idx[7]]*(Clip3(−c[idx[7]],c[idx[7]],recPicture_(L)            [h _(x−1) ,v            _(y+r1)]−curr)+Clip3(−c[idx[7]],c[idx[7]],recPicture_(L) [h            _(x+1) ,v            _(y−r1)]−curr))+f[idx[8]]*(Clip3(−c[idx[8]],c[idx[8]],recPicture_(L)            [h _(x−2) ,v            _(y+r1)]−curr)+Clip3(−c[idx[8]],c[idx[8]],recPicture_(L) [h            _(x+2) ,v            _(y−r1)]−curr))+f[idx[9]]*(Clip3(−c[idx[9]],c[idx[9]],recPicture_(L)            [h _(x+3) ,v            _(y)]−curr)+Clip3(−c[idx[9]],c[idx[9]],recPicture_(L) [h            _(x−3) ,v            _(y)]−curr))+f[idx[10]]*(Clip3(−c[idx[10]],c[idx[10]],recPicture_(L)            [h _(x+2) ,v            _(y)]−curr)+Clip3(−c[idx[10]],c[idx[10]],recPicture_(L) [h            _(x−2) ,v            _(y)]−curr))+f[idx[11]]*(Clip3(−c[idx[11]],c[idx[11]],recPicture_(L)            [h _(x+1) ,v            _(y)]−curr)+Clip3(−c[idx[11]],c[idx[11]],recPicture_(L) [h            _(x−1) ,v _(y)]−curr))  (8-1189)            sum=curr+((sum+64)>>7)  (8-1190)

    -   The modified filtered reconstructed luma picture sample        alfPicture_(L)[xCtb+x][yCtb+y] may be derived as follows:        -   If pcm_loop_filter_disabled_flag and            pcm_flag[xCtb+x][yCtb+y] are both equal to 1, the following            applies:            alfPicture_(L) [xCtb+x][yCtb+y]=recPicture_(L) [h _(x) ,v            _(y)]  (8-1191)        -   Otherwise (pcm_loop_filter_disabled_flag is equal to 0 or            pcm_flag[x][y] is equal 0), the following applies:

TABLE 8-22 Specification of r1, r2, and r3 according to the horizontalluma sample position y and applyVirtualBoundary condition r1 r2 r3 ( y == CtbSizeY − 5 | | y = = CtbSizeY − 4 ) && ( applyVirtualBoundary = = 00 0 1 ) ( y = = CtbSizeY − 6 | | y = = CtbSizeY − 3 ) && (applyVirtualBoundary = = 1 1 1 1 ) ( y = = CtbSizeY − 7 | | y = =CtbSizeY − 2 ) && ( applyVirtualBoundary = = 1 2 2 1 ) otherwise 1 2 3

8.8.5.4 Coding Tree Block Filtering Process for Chroma Samples

Inputs of this process are:

-   -   a reconstructed chroma picture sample array recPicture prior to        the adaptive loop filtering process,    -   a filtered reconstructed chroma picture sample array alfPicture,    -   a chroma location (xCtbC, yCtbC) specifying the top-left sample        of the current chroma coding tree block relative to the top left        sample of the current picture.

Output of this process is the modified filtered reconstructed chromapicture sample array alfPicture.

The width and height of the current chroma coding tree block ctbWidthCand ctbHeightC may be derived as follows:ctbWidthC=CtbSizeY/SubWidthC  (8-1230)ctbHeightC=CtbSizeY/SubHeightC  (8-1231)

For the derivation of the filtered reconstructed chroma samplesalfPicture[x][y], each reconstructed chroma sample inside the currentchroma coding tree block recPicture[x][y] is filtered as follows withx=0 . . . ctbWidthC−1, y=0 . . . ctbHeightC−1:

-   -   The locations (h_(x+i), v_(y+j)) for each of the corresponding        chroma samples (x, y) inside the given array recPicture of        chroma samples with i, j=−2 . . . 2 may be derived as follows:        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            xCtbC+x−PpsVirtualBoundariesPosX[n]/SubWidthC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(PpsVirtualBoundariesPosX[n]/SubWidthC,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1232)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosX[n]/SubWidthC−xCtbC−x            is greater than 0 and less than 3 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]/SubWidthC−1,xCtbC+x+i)              (8-1233)        -   Otherwise, the following applies:            h            _(x+i)=Clip3(0,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1234)        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            yCtbC+y−PpsVirtualBoundariesPosY[n]/SubHeightC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(PpsVirtualBoundariesPosY[n]/SubHeightC,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)  (8-1235)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and            PpsVirtualBoundariesPosY[n]/SubHeightC−yCtbC−y is greater            than 0 and less than 3 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n]/SubHeightC−1,yCtbC+y+j)              (8-1236)        -   Otherwise, the following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)  (8-1237)    -   The variable applyVirtualBoundary may be derived as follows:        -   -   

            -   

            -   

            -   

        -       -   The reconstructed sample offsets r1 and r2 are specified in        Table 8-22 according to the horizontal luma sample position y        and apply VirtualBoundary.    -   The variable curr may be derived as follows:        curr=recPicture[h _(x) ,v _(y)]  (8-1238)    -   The array of chroma filter coefficients f[j] and the array of        chroma clipping values c[j] may be derived as follows with j=0 .        . . 5:        f[j]=AlfCoeff_(C)[slice_alf_aps_id_chroma][j]   (8-1239)        c[j]=AlfClip_(C)[slice_alf_aps_id_chroma][j]   (8-1240)    -   The variable sum may be derived as follows:        sum=f[0]*(Clip3(−c[0],c[0],recPicture[h _(x) ,v        _(y+r2)]−curr)+Clip3(−c[0],c[0],recPicture[h _(x) ,v        _(y−r2)]−curr))+f[1]*(Clip3(−c[1],c[1],recPicture[h _(x+1) ,v        _(y+r1)]−curr)+Clip3(−c[1],c[1],recPicture[h _(x−1) ,v        _(y−r1)]−curr))+f[2]*(Clip3(−c[2],c[2],recPicture[h _(x) ,v        _(y+r1)]−curr)+Clip3(−c[2],c[2],recPicture[h _(x) ,v        _(y−r1)]−curr))+f[3]*(Clip3(−c[3],c[3],recPicture[h _(x−1) ,v        _(y+r1)]−curr)+Clip3(−c[3],c[3],recPicture[h _(x+1) ,v        _(y−r1)]−curr))+f[4]*(Clip3(−c[4],c[4],recPicture[h _(x+2) ,v        _(y)]−curr)+Clip3(−c[4],c[4],recPicture[h _(x−2) ,v        _(y)]−curr))+f[5]*(Clip3(−c[5],c[5],recPicture[h _(x+1) ,v        _(y)]−curr)+Clip3(−c[5],c[5],recPicture[h _(x−1) ,v        _(y)]−curr))  (8-1241)        sum=curr+(sum+64)>>7)  (8-1242)    -   The modified filtered reconstructed chroma picture sample        alfPicture[xCtbC+x][yCtbC+y] may be derived as follows:        -   If pcm_loop_filter_disabled_flag and            pcm_flag[(xCtbC+x)*SubWidthC][(yCtbC+y)*SubHeightC] are both            equal to 1, the following applies:            alfPicture[xCtbC+x][yCtbC+y]=recPicture_(L) [h _(x) ,v            _(y)]  (8-1243)        -   Otherwise (pcm_loop_filter_disabled_flag is equal to 0 or            pcm_flag[x][y] is equal 0), the following applies:            alfPicture[xCtbC+x][yCtbC+y]=Clip3(0,(1<<BitDepth_(C))−1,sum)  (8-1244)

2.11 Examples of CTU Processing

According to the current VVC design, if the bottom boundary of one CTBis a bottom boundary of a slice/brick, the ALF virtual boundary handlingmethod is disabled. For example, one picture is split to multiple CTUsand 2 slices as depicted FIG. 19 .

Suppose the CTU size is M×M (e.g., M=64), according to the virtualboundary definition, the last 4 lines within a CTB are treated below avirtual boundary. In hardware implementation, the following apply:

-   -   If the bottom boundary of the CTB is the bottom boundary of a        picture (e.g., CTU-D), it processes the (M+4)×M block including        4 lines from above CTU row and all lines in current CTU.    -   Otherwise, if the bottom boundary of the CTB is the bottom        boundary of a slice (or brick) (e.g., CTU-C) and        loop_filter_across_slice_enabled_flag (or        loop_filter_across_bricks_enabled_flag) is equal to 0, it        processes the (M+4)×M block including 4 lines from above CTU row        and all lines in current CTU.    -   Otherwise, if a CTU/CTB in the first CTU row in a        slice/brick/tile (e.g., CTU-A), it processes the M×(M−4) block        excluding the last 4 lines.    -   Otherwise, if a CTU/CTB in not in the first CTU row of a        slice/brick/tile (e.g., CTU-B) and not in the last CTU row of a        of a slice/brick/tile, it processes the M×M block including 4        lines from above CTU row and excluding the last 4 lines in        current CTU.

FIG. 19 shows an example of processing of CTUs in a picture.

2.12 360-Degree Video Coding

The horizontal wrap around motion compensation in the VTM5 is a360-specific coding tool designed to improve the visual quality ofreconstructed 360-degree video in the equi-rectangular projection (ERP)format. In conventional motion compensation, when a motion vector refersto samples beyond the picture boundaries of the reference picture,repetitive padding is applied to derive the values of the out-of-boundssamples by copying from those nearest neighbors on the correspondingpicture boundary. For 360-degree video, this method of repetitivepadding is not suitable, and could cause visual artefacts called “seamartefacts” in a reconstructed viewport video. Because a 360-degree videois captured on a sphere and inherently has no “boundary,” the referencesamples that are out of the boundaries of a reference picture in theprojected domain can be obtained from neighboring samples in thespherical domain. For a general projection format, it may be difficultto derive the corresponding neighboring samples in the spherical domain,because it involves two-dimensional (2D) to three-dimensional (3D) and3D-to-2D coordinate conversion, as well as sample interpolation forfractional sample positions. This problem is much simpler for the leftand right boundaries of the ERP projection format, as the sphericalneighbors outside of the left picture boundary can be obtained fromsamples inside the right picture boundary, and vice versa.

FIG. 20 shows an example of horizontal wrap around motion compensationin VVC.

The horizontal wrap around motion compensation process is as depicted inFIG. 20 . When a part of the reference block is outside of the referencepicture's left (or right) boundary in the projected domain, instead ofrepetitive padding, the “out-of-boundary” part is taken from thecorresponding spherical neighbors that are of the reference picturetoward the right (or left) boundary in the projected domain. Repetitivepadding may only be used for the top and bottom picture boundaries. Asdepicted in FIG. 20 , the horizontal wrap around motion compensation canbe combined with the non-normative padding method often used in360-degree video coding. In VVC, this is achieved by signaling ahigh-level syntax element to indicate the wrap-around offset, whichshould be set to the ERP picture width before padding; this syntax isused to adjust the position of horizontal wrap around accordingly. Thissyntax is not affected by the specific amount of padding on the left andright picture boundaries, and therefore naturally supports asymmetricpadding of the ERP picture, e.g., when left and right padding aredifferent. The horizontal wrap around motion compensation provides moremeaningful information for motion compensation when the referencesamples are outside of the reference picture's left and rightboundaries.

For projection formats composed of a plurality of faces, no matter whatkind of compact frame packing arrangement is used, discontinuities mayappear between two or more adjacent faces in the frame packed picture.For example, considering the 3×2 frame packing configuration depicted inFIG. 24 , the three faces in the top half are continuous in the 3Dgeometry, the three faces in the bottom half are continuous in the 3Dgeometry, but the top and bottom halves of the frame packed picture arediscontinuous in the 3D geometry. If in-loop filtering operations areperformed across this discontinuity, face seam artifacts may becomevisible in the reconstructed video.

To alleviate face seam artifacts, in-loop filtering operations may bedisabled across discontinuities in the frame-packed picture. A syntaxwas proposed to signal vertical and/or horizontal virtual boundariesacross which the in-loop filtering operations are disabled. Compared tousing two tiles, one for each set of continuous faces, and to disablein-loop filtering operations across tiles, the proposed signaling methodis more flexible as it does not require the face size to be a multipleof the CTU size.

2.13 Example Sub-Picture Based Motion-Constrained Independent Regions

In some embodiments, the following features are included:

1) Pictures may be divided into sub-pictures.

2) The indication of existence of sub-pictures is indicated in the SPS,along with other sequence-level information of sub-pictures.

3) Whether a sub-picture is treated as a picture in the decoding process(excluding in-loop filtering operations) can be controlled by thebitstream.

4) Whether in-loop filtering across sub-picture boundaries is disabledcan be controlled by the bitstream for each sub-picture. The DBF, SAO,and ALF processes are updated for controlling of in-loop filteringoperations across sub-picture boundaries.

5) For simplicity, as a starting point, the sub-picture width, height,horizontal offset, and vertical offset are signalled in units of lumasamples in SPS. Sub-picture boundaries are constrained to be sliceboundaries.

6) Treating a sub-picture as a picture in the decoding process(excluding in-loop filtering operations) is specified by slightlyupdating the coding_tree_unit( ) syntax, and updates to the followingdecoding processes:

-   -   The derivation process for (advanced) temporal luma motion        vector prediction    -   The luma sample bilinear interpolation process    -   The luma sample 8-tap interpolation filtering process    -   The chroma sample interpolation process

7) Sub-picture IDs are explicitly specified in the SPS and included inthe tile group headers to enable extraction of sub-picture sequenceswithout the need of changing VCL NAL units.

Output sub-picture sets (OSPS) are proposed to specify normativeextraction and conformance points for sub-pictures and sets thereof.

3. TECHNICAL PROBLEMS SOLVED BY THE SOLUTIONS PROVIDED IN THE PRESENTDOCUMENT

The current VVC design has the following problems:

1. The current setting of enabling ALF virtual boundary is dependent onwhether the bottom boundary of a CTB is a bottom boundary of a picture.If it is true, then ALF virtual boundary is disabled, such as CTU-D inFIG. 19 . However, it is possible that a bottom boundary of a CTB isoutside a bottom boundary of a picture, such as 256×240 picture is splitto 4 128×128 CTUs, in this case, the ALF virtual boundary would bewrongly set to true for the last 2 CTUs which has samples outside of thebottom picture boundary.

2. The way for handling ALF virtual boundary is disabled for bottompicture boundary and slice/tile/brick boundary. Disabling VB alongslice/brick boundary may create pipeline bubble or require processing 68lines per Virtual pipeline data units (VPDU, 64×64 in VVC) assuming theLCU size to be 64×64. For example:

a. For decoders not knowing the slice/brick/tile boundaries upfront(w.e. low-delay applications), the ALF line buffers need to be restored.Whether the content in the line buffers get used or not for the ALFfiltering depends on whether the current CTU is also a slice/brick/tileboundary CTU, this information, however, is unknown until the nextslice/brick/tile is decoded.

b. For decoders knowing the slice/brick/tile boundaries upfront, eitherthe decoders need to live with pipeline bubbles (very unlikely) or runthe ALF at a speed of 68 lines per 64×64 VDPU all the time(overprovision), to avoid using the ALF line buffers.

3. Different ways for handling virtual boundary and video unit boundary,e.g., different padding methods are existing. Meanwhile, more than onepadding methods may be performed for a line when it is at multipleboundaries.

a. In one example, if the bottom boundary of a block is a 360 degreevirtual boundary and ALF virtual boundary is also applied to this block,in this case, the padding method for 360 degree virtual boundary may befirstly applied to generate virtual samples below the 360 degree virtualboundary. Afterwards, these virtual samples located below the 360 degreevirtual boundary are treated as being available. And the ALF 2-sidepadding method may be further applied according to FIG. 16A-C. Anexample is depicted in FIG. 25 .

4. The way for handling virtual boundary may be sub-optimal, sincepadded samples are utilized which may be less efficient.

5. When the non-linear ALF is disabled, the MALF and two-side paddingmethods would be able to generate the same results for filtering asample which requires to access samples crossing virtual boundary.However, when the non-linear ALF is enabled, the two methods would bringdifferent results. It would be beneficial to align the two cases.

4. EXAMPLES OF TECHNIQUES AND EMBODIMENTS

The listing below should be considered as examples to explain generalconcepts. The listed techniques should not be interpreted in a narrowway. Furthermore, these techniques can be combined in any manner.

The padding method used for ALF virtual boundaries may be denoted as‘Two-side Padding’ wherein if one sample located at (i, j) is padded,then the corresponding sample located at (m, n) which share the samefilter coefficient is also padded even the sample is available, asdepicted in FIGS. 12-13 .

The padding method used for picture boundaries/360-degree video virtualboundaries, normal boundaries (e.g. top and bottom boundaries) may bedenoted as ‘One-side Padding’ wherein if one sample to be used isoutside the boundaries, it is copied from an available one inside thepicture.

The padding method used for 360-degree video left and right boundariesmay be denoted as ‘wrapping-base Padding’ wherein if one sample to beused is outside the boundaries, it is copied using the motioncompensated results.

In the following discussion, a sample is “at a boundary of a video unit”may mean that the distance between the sample and the boundary of thevideo unit is less or no greater than a threshold. A “line” may refer tosamples at one same horizontal position or samples at one same verticalposition. (e.g., samples in the same row and/or samples in the samecolumn). Function Abs(x) may be defined as follows:

${{Abs}(x)} = \left\{ {\begin{matrix}{x;} & {x>=0} \\{{- x};} & {x < 0}\end{matrix}.} \right.$

In the following discussion, a “virtual sample” refers to a generatedsample which may be different from the reconstructed sample (may beprocessed by deblocking and/or SAO). A virtual sample may be used toconduct ALF for another sample. The virtual sample may be generated bypadding.

‘ALF virtual boundary handling method is enabled for one block’ mayindicate that applyVirtualBoundary in the specification is set to true.‘Enabling virtual boundary’ may indicate that the current block is splitto at least two parts by a virtual boundary and the samples located inone part are disallowed to utilize samples in the other part in thefiltering process (e.g., ALF). The virtual boundary may be K rows abovethe bottom boundary of one block.

In the following descriptions, the neighboring samples may be thosewhich are required for the filter classification and/or filteringprocess.

In the disclosure, a neighboring sample is “unavailable” if it is out ofthe current picture, or current sub-picture, or current tile, or currentslice, or current brick, or current CTU, or current processing unit(such as ALF processing unit or narrow ALF processing unit), or anyother current video unit.

-   -   1. The determination of ‘The bottom boundary of the current        coding tree block is the bottom boundary of the picture’ is        replaced by ‘The bottom boundary of the current coding tree        block is the bottom boundary of the picture or outside the        picture’.        -   a. Alternatively, furthermore, in this case, the ALF virtual            boundary handling method may be disabled.    -   2. Whether to enable the usage of virtual samples (e.g., whether        to enable virtual boundary (e.g., set applyVirtualBoundary to        true or false)) in the in-loop filtering process may depend on        the CTB size.        -   a. In one example, applyVirtualBoundary is always set to            false for a given CTU/CTB size, e.g., for the CTU/CTB size            equal to K×L (e.g., K=L=4).        -   b. In one example, applyVirtualBoundary is always set to            false for certain CTU/CTB sizes no greater than or smaller            than K×L (e.g., K=L=8).        -   c. Alternatively, ALF is disabled for certain CTU/CTB sizes,            such as 4×4, 8×8.    -   3. Whether to enable the usage of virtual samples (e.g, padded        from reconstructed samples) in the in-loop filtering processes        (e.g., ALF) may depend on whether the bottom boundary of the        block is the bottom boundary of a video unit which is in a finer        granularity compared to a picture (e.g., slice/tile/brick) or a        virtual boundary.        -   a. In one example, the ALF virtual boundary handling method            may be enabled (e.g., applyVirtualBoundary is set to true)            for a coding tree block (CTB) if the bottom boundary of the            CTB is the boundary of the video unit or a virtual boundary.            -   i. Alternatively, furthermore, if the bottom boundary is                not a bottom picture boundary or if the bottom boundary                is outside the picture, the above method is enabled.        -   b. When the bottom boundary of the current coding tree block            is one of the bottom virtual boundaries of the picture and            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1, the ALF virtual boundary handling method may            still be enabled (e.g., applyVirtualBoundary is set to            true).        -   c. In one example, whether to enable the ALF virtual            boundary handling method (e.g., value of            applyVirtualBoundary) for a CTB may only depend on the            relationship between the bottom boundary of the CTB and the            bottom boundary of a picture.            -   i. In one example, applyVirtualBoundary is set to false                only if the bottom boundary of the CTB is the bottom                boundary of a picture containing the CTB or if the                bottom boundary is outside the picture.            -   ii. In one example, applyVirtualBoundary is set to true                when the bottom boundary of the CTB is NOT the bottom                boundary of a picture containing the CTB.        -   d. In one example, for when decoding the CTU-C in FIGS.            18A-18C, M×M samples may be filtered with K lines from above            CTU and excluding K lines below the virtual boundary.    -   4. It is proposed to disable the usage of samples across        brick/slice boundaries in the filtering process (e.g., ALF) even        when the signalled controlling usage flags for loop filters        crossing brick/slice boundaries (e.g.,        loop_filter_across_bricks_enabled_flag/loop_filter_across_slices_enabled_flag)        is true.        -   a. Alternatively, furthermore, the signalled            loop_filter_across_bricks_enabled_flag/loop_filter_across_slices_enabled_f            lag may only control the filtering process of deblocking            filter and SAO excluding ALF.        -   b. In one example, a virtual sample may be used instead of            the reconstructed sample at the corresponding position to            conduct ALF for another sample.    -   5. When one block (e.g., CTB) contains a sample located at a        boundary of a video unit (such as slice/brick/tile/360-degree        video virtual or normal boundaries boundaries/picture boundary),        how to generate the virtual sample inside or outside the video        unit (e.g., padding methods) for in-loop filtering such as ALF        may be unified for different kinds of boundaries.        -   a. Alternatively, furthermore, the method of virtual            boundaries (e.g., the Two-side Padding method) may be            applied to the block to handle the sample at boundary for            in-loop filtering.        -   b. Alternatively, furthermore, the above methods may be            applied when the block contains a sample located at the            bottom boundary of the video unit.        -   c. In one example, when decoding the K lines of one block,            if the K lines below the virtual boundary of the block            (e.g., the last K lines in CTU-B of FIGS. 17A-17B) and the            bottom boundary of the block is the bottom boundary of a            video unit, virtual samples may be generated in the ALF            classification/filtering process to avoid usage of other            samples outside these K lines, e.g., the Two-side Padding            method may be applied.            -   i. Alternatively, ALF may be disabled for those last K                lines.        -   d. In one example, when one block is at multiple boundaries,            pixels/samples used for ALF classification may be restricted            to not across any of these multiple boundaries.            -   i. In one example, for a sample, if certain neighboring                sample of it is “unavailable” (e.g., across any of the                multiple boundaries), alone or all kinds of                gradients/directionality may not be calculated for the                sample.                -   1. In one example, gradients of the sample may be                    treated as zero.                -   2. In one example, gradients of the sample may be                    treated as “unavailable” and may not be added to the                    activity (e.g., defined in Eq. (8) of section                    2.6.1.1) derived in the ALF classification process.            -   ii. In one example, the activity/directionality derived                in the ALF classification process may be scaled by a                factor when only partial samples used in ALF                classification process are “available” (e.g., not across                any of these boundaries).            -   iii. In one example, for a boundary block, suppose the                gradients/directionality are required to be calculated                for N samples in the ALF classification process, and the                gradients can only be calculated for M samples (e.g., if                certain neighboring sample of a sample is not                “available”, then the gradient cannot be calculated for                it), then the activity may be multiplied by N/M.                -   1. Alternatively, it may be multiplied by a factor                    dependent on N/M. E.g., the number may be of M^(N)                    (N is an integer), for example, M=2.        -   e. In one example, when one line is at multiple boundaries            (e.g., the distance between the line to the boundary is less            than a threshold), the padding process is performed only            once regardless how many boundaries it may belong to.            -   i. Alternatively, furthermore, how many neighboring                lines shall be padded may be dependent on the position                of the current line relative to all the boundaries.            -   ii. For example, how many neighboring lines shall be                padded may be decided by the distances between the                current line and the two boundaries, such as when the                current line is within two boundaries, with the two                boundaries being above and below.            -   iii. For example, how many neighboring lines shall be                padded may be decided by the distance between the                current line and the nearest boundary, such as when the                current line is within two boundaries, with the two                boundaries being above and below.            -   iv. For example, how many neighboring lines shall be                padded may be calculated for each boundary                independently, and the maximum one is selected as the                final padded line number.            -   v. In one example, how many neighboring lines shall be                padded may be decided for each side (e.g., the above                side and the below side) of the line.            -   vi. In one example, for the two-side padding method, how                many neighboring lines shall be padded may be decided                jointly for the two sides.            -   vii. Alternatively, furthermore, the 2-side padding                method used by ALF is applied.        -   f. In one example, when one line is at multiple boundaries            and there is at least one boundary in each side (e.g., the            above side and the below side) of the line, ALF may be            disabled for it.        -   g. In one example, when the number of the padded lines            required by the current line is larger than a threshold, ALF            may be disabled for the current line.            -   i. In one example, when the number of the padded lines                in any side is larger than a threshold, ALF may be                disabled for the current line.            -   ii. In one example, when the total number of the padded                lines in both sides is larger than a threshold, ALF may                be disabled for the current line.        -   h. Alternatively, furthermore, the above methods may be            applied when the block contains a sample located at the            bottom boundary of the video unit and the in-loop filtering            such as ALF is enabled for the block.        -   i. Alternatively, furthermore, the above methods may be            applied under certain conditions, such as when the block            contains a sample located at the bottom boundary of the            video unit and filtering crossing the boundaries is            disallowed (e.g.,            pps_loop_filter_across_virtual_boundaries_disabled_flag/loop_filter_across_slices_enabled_flag/loop_filter_across_slices_enabled_fl            ag is true).        -   j. Proposed method is also applicable to samples/blocks            located at vertical boundaries.    -   6. When a sample is of at least two boundaries of one block        (e.g., at least one which is above current line is the ALF        Virtual boundary, and below is the other boundary), how many        lines to be padded is not purely decided by the distance between        current line relative to the ALF virtual boundary. Instead, it        is determined by the distances between current line relative to        the two boundaries.        -   a. In one example, the number of lines for per-side padding            is set to (M−min (D0, D1)).        -   b. In one example, the number of lines for per-side padding            is set to (M−max (D0, D1)).        -   c. For above example, D0, D1 denote the distance between            current line and the above/below boundaries.        -   d. For above example, M denote the number of lines that ALF            virtual boundary is from the bottom of one CTU.    -   7. At least two ways of selecting samples in the ALF        classification and/or ALF linear or non-linear filtering process        may be defined, with one of them selects samples before any        in-loop filtering method is applied; and the other selects        samples after one or multiple in-loop filtering methods are        applied but before ALF is applied.        -   a. In one example, the selection of different ways may            depend on the location of samples to be filtered.        -   b. In one example, a sample at the bottom boundary of a            video unit (such as CTB) may be selected with the first            method when it is used in ALF for another sample. Otherwise            (it is not at the boundary), the second method is selected.    -   8. It is proposed to disable the usage of samples crossing a        VPDU boundary (e.g., a 64×64 region) in the filtering process.        -   a. In one example, when a sample required by the ALF            classification process is outside the VPDU boundary, or            below the virtual boundary, it may be replaced by a virtual            sample or the classification results for the sample may be            copied from that associated with other samples, such as            padded from available ones.        -   b. In one example, when a sample required by a filtering            process is outside the VPDU boundary, or below the virtual            boundary, it may be replaced by a virtual sample, such as            padded from available ones.        -   c. In one example, the ALF virtual boundary handling method            may be enabled (e.g., applyVirtualBoundary is set to true)            for a block if it contains samples located at the boundary            of a VPDU.        -   d. Alternatively, usage of samples crossing a horizontal            VPDU boundary may be disabled in the filtering process.            -   i. In one example, when a sample required by a filtering                process is below the horizontal VPDU boundary, or below                the virtual boundary, it may be replaced by a virtual                sample, such as padded from available ones.        -   e. Alternatively, usage of samples crossing a vertical VPDU            boundary may be disabled in the filtering process.            -   i. In one example, when a sample required by a filtering                process is outside the vertical VPDU boundary, or below                the virtual boundary, it may be replaced by a virtual                sample, such as padded from available ones.    -   9. Instead of using padded samples (e.g., not unavailable,        above/below virtual boundaries, above/below boundaries of a        video unit) in the ALF classification/filtering process, it is        proposed to use the reconstructed samples before all in-loop        filters.        -   a. Alternatively, furthermore, the concept of two-side            padding is applied via padding samples from the            reconstructed samples before all in-loop filters.            -   i. In one example, if a sample in a filter support is                from reconstructed samples before all in-loop filters,                the symmetric (e.g., symmetrical about the origin, e.g.,                the current sample) sample in the filter support shall                also uses the reconstructed one before all in-loop                filters.                -   1. Suppose the coordinate of the current sample to                    be filtered is (0, 0) and the sample located at                    (i, j) is the reconstructed one before all in-loop                    filters, then the sample located at (−i, −j) is the                    reconstructed one before all in-loop filters.                -   2. Suppose the coordinate of the current sample to                    be filtered is (x, y) and the sample located at                    (x+i, y+j) is the reconstructed one before all                    in-loop filters, then the sample located at (x−i,                    y−j) is the reconstructed one before all in-loop                    filters.        -   b. Alternatively, furthermore, when In-loop reshaping (a.k.a            LMCS) is enabled, the reconstructed samples before all            in-loop filters are those in the original domain converted            from the reshaped domain.    -   10. Instead of using padded samples (e.g., not unavailable,        above/below virtual boundaries, above/below boundaries of a        video unit) in the ALF filtering process, it is proposed to        employ different ALF filter supports.        -   a. In one example, suppose a sample needs to be padded in            the above method, instead of performing the padding, filter            coefficient associated with the sample is set to be zero.            -   i. In this case, the filter support is modified by                excluding samples which require to be padded.            -   ii. Alternatively, furthermore, the filter coefficients                applied to other samples except the current sample is                kept unchanged, however, the filter coefficient applied                to current sample may be modified, such as                ((1<<C_BD)−sum of all filter coefficients applied to                samples which do not need to be padded) wherein C_BD                indicates the filter coefficient's bit-depth.                -   1. Taking FIGS. 18A-18B for example, when filtering                    lines L and I, the filter coefficient c12 applied to                    current sample is modified to be                    ((1<<C_BD)−2*(c4+c5+c6+c7+c8+c9+c10+c11)).        -   b. In one example, suppose a sample (x1, y1) is padded from            (x2, y2) in above method, instead of performing the padding,            filter coefficient associated with (x1, y1) is added to that            of the position (x2, y2) regardless the non-linear filter is            enabled or disabled.            -   i. Alternatively, furthermore, the clipping parameter                for (x2, y2) may be derived on-the-fly.                -   1. In one example, it may be set equal to the                    decoded clipping parameter for (x2, y2).                -   2. Alternatively, it may be set to the returned                    value of a function with the decoded clipping                    parameters for (x1, y1) and (x2, y2) as inputs, such                    as larger value or smaller value.    -   11. Selection of clipping parameters/filter coefficients/filter        supports may be dependent on whether filtering a sample need to        access padded samples (e.g., not unavailable, above/below        virtual boundaries, above/below boundaries of a video unit).        -   a. In one example, different clipping parameters/filter            coefficients/filter supports may be utilized for samples            with same class index but for some of them require accessing            padded samples and others do not.        -   b. In one example, the clipping parameters/filter            coefficients/filter supports for filtering samples which            require to access padded samples may be signalled in            CTU/region/slice/tile level.        -   c. In one example, the clipping parameters/filter            coefficients/filter supports for filtering samples which            require to access padded samples may be derived from that            used for filtering samples which do not require to access            padded samples.            -   i. In one example, bullets 9a or 9b may be applied.    -   12. How to handle a sample at a boundary for in-loop filtering        (such as ALF) may depend on the color component and/or color        format.        -   a. For example, the definition of “at boundary” may be            different for different color components. In one example, a            luma sample is at the bottom boundary if the distance            between it and the bottom boundary is less than T1; a chroma            sample is at the bottom boundary if the distance between it            and the bottom boundary is less than T2. T1 and T2 may be            different.            -   i. In one example, T1 and T2 may be different when the                color format is not 4:4:4.    -   13. When bottom/top/left/right boundary of one CTU/VPDU is also        a boundary of a slice/tile/brick/sub-region with independent        coding, a fixed order of multiple padding processes is applied.        -   a. In one example, in a first step, the padding method            (e.g., 1-side padding) of slice/tile/brick is firstly            applied. Afterwards, the padding method for handling ALF            virtual boundaries (e.g., 2-side padding method) is further            applied during a second step. In this case, the padded            samples after the first step are marked as available and may            be used to decide how many lines to be padded in the ALF            virtual boundary process. The same rule (e.g., FIG. 16 ) for            handling CTUs which are not located at those boundaries are            utilized.    -   14. The proposed methods may be applied to one or multiple        boundaries between two sub-pictures.        -   a. The boundary applying the proposed methods may be a            horizontal boundary.        -   b. The boundary applying the proposed methods may be a            vertical boundary.    -   15. The above proposed methods may be applied to samples/blocks        at vertical boundaries.    -   16. Whether or/and how proposed method is applied at “360        virtual boundary” may be dependent on the position of the “360        virtual boundary”.        -   a. In one example, when the “360 virtual boundary” coincides            with a CTU boundary, proposed method may be applied. E.g.,            Only the 2-side padding may be applied in ALF for samples at            “360 virtual boundary”.        -   b. In one example, when the “360 virtual boundary” does not            coincide with a CTU boundary, proposed method may not be            applied. E.g., only the 1-side padding may be applied in ALF            for samples at “360 virtual boundary”.        -   c. In one example, for samples at multiple boundaries            wherein at least one boundary is a “360 virtual boundary”            and at least one of the “360 virtual boundary” does not            coincide with a CTU boundary, proposed method may not be            applied.            -   i. For example, samples across any of these multiple                boundaries may be padded by 1-side padding.

1. Alternatively, furthermore, if there is a “virtual boundary”, 2-sidepadding may be applied in ALF after the 1-side padding.

5. EMBODIMENTS

In the sections below, some examples of how current version of the VVCstandard can be modified to accommodate the disclosed embodiments isdescribed. Newly added parts are indicated in bold italicized text. Thedeleted parts are indicated using [[ ]].

5.1 Embodiment #1

loop_filter_across_bricks_enabled_flag equal to 1 specifies that in-loopfiltering operations may be performed across brick boundaries inpictures referring to the PPS. loop_filter_across_bricks_enabled_flagequal to 0 specifies that in-loop filtering operations are not performedacross brick boundaries in pictures referring to the PPS. The in-loopfiltering operations include the deblocking filter, sample adaptiveoffset filter[[, and adaptive loop filter]] operations. When notpresent, the value of loop_filter_across_bricks_enabled_flag is inferredto be equal to 1.

loop_filter_across_slices_enabled_flag equal to 1 specifies that in-loopfiltering operations may be performed across slice boundaries inpictures referring to the PPS. loop_filter_across_slice_enabled_flagequal to 0 specifies that in-loop filtering operations are not performedacross slice boundaries in pictures referring to the PPS. The in-loopfiltering operations include the deblocking filter, sample adaptiveoffset filter[[, and adaptive loop filter]] operations. When notpresent, the value of loop_filter_across_slices_enabled_flag is inferredto be equal to 0.

5.2 Embodiment #2

FIG. 21 shows processing of CTUs in a picture. The differences comparedto FIG. 19 highlighted with the dashed lines.

5.3 Embodiment #3

8.8.5.2 Coding Tree Block Filtering Process for Luma Samples

Inputs of this process are:

-   -   a reconstructed luma picture sample array recPicture_(L) prior        to the adaptive loop filtering process,    -   a filtered reconstructed luma picture sample array        alfPicture_(L),    -   a luma location (xCtb, yCtb) specifying the top-left sample of        the current luma coding tree block relative to the top left        sample of the current picture.

Output of this process is the modified filtered reconstructed lumapicture sample array alfPicture_(L).

The derivation process for filter index clause 8.8.5.3 is invoked withthe location (xCtb, yCtb) and the reconstructed luma picture samplearray recPicture_(L) as inputs, and filtIdx[x][y] and transposeIdx[x][y]with x, y=0 . . . CtbSizeY−1 as outputs.

For the derivation of the filtered reconstructed luma samplesalfPicture_(L)[x][y], each reconstructed luma sample inside the currentluma coding tree block recPicture_(L)[x][y] is filtered as follows withx, y=0 . . . CtbSizeY−1:

-   -   The array of luma filter coefficients f[j] and the array of luma        clipping values c[j] corresponding to the filter specified by        filtIdx[x][y] may be derived as follows with j=0 . . . 11:        -   . . .    -   The luma filter coefficients and clipping values index idx may        be derived depending on transposeIdx[x][y] as follows:        -   . . .    -   The locations (h_(x)+v_(y+j)) for each of the corresponding luma        samples (x, y) inside the given array recPicture of luma samples        with i, j=−3 . . . 3 may be derived as follows:        -   . . .    -   The variable applyVirtualBoundary may be derived as follows:        -   If [[one or more of]] the following condition[[s are]] is            true, applyVirtualBoundary is set equal to 0:            -   The bottom boundary of the current coding tree block is                the bottom boundary of the picture.            -   [[—The bottom boundary of the current coding tree block                is the bottom boundary of the brick and                loop_filter_across_bricks_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the slice and                loop_filter_across_slices_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                one of the bottom virtual boundaries of the picture and                pps_loop_filter_across_virtual_boundaries_disabled_flag                is equal to 1.]]            -   Otherwise, applyVirtualBoundary is set equal to 1.        -   The reconstructed sample offsets r1, r2 and r3 are specified            in Table 8-22 according to the horizontal luma sample            position y and apply VirtualBoundary.        -   . . .

8.8.5.4 Coding Tree Block Filtering Process for Chroma Samples

Inputs of this process are:

-   -   a reconstructed chroma picture sample array recPicture prior to        the adaptive loop filtering process,    -   a filtered reconstructed chroma picture sample array alfPicture,    -   a chroma location (xCtbC, yCtbC) specifying the top-left sample        of the current chroma coding tree block relative to the top left        sample of the current picture.

Output of this process is the modified filtered reconstructed chromapicture sample array alfPicture.

The width and height of the current chroma coding tree block ctbWidthCand ctbHeightC may be derived as follows:ctbWidthC=CtbSizeY/SubWidthC  (8-1230)ctbHeightC=CtbSizeY/SubHeightC  (8-1231)

For the derivation of the filtered reconstructed chroma samplesalfPicture[x][y], each reconstructed chroma sample inside the currentchroma coding tree block recPicture[x][y] is filtered as follows withx=0 . . . ctbWidthC−1, y=0 . . . ctbHeightC−1:

-   -   The locations (h_(x+i), v_(y+j)) for each of the corresponding        chroma samples (x, y) inside the given array recPicture of        chroma samples with i, j=−2 . . . 2 may be derived as follows:        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            xCtbC+x−PpsVirtualBoundariesPosX[n]/SubWidthC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(PpsVirtualBoundariesPosX[n]/SubWidthC,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1232)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosX[n]/SubWidthC−xCtbC−x            is greater than 0 and less than 3 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]/SubWidthC−1,xCtbC+x+i)              (8-1233)        -   Otherwise, the following applies:            h            _(x+i)=Clip3(0,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1234)        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            yCtbC+y−PpsVirtualBoundariesPosY[n]/SubHeightC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(PpsVirtualBoundariesPosY[n]/SubHeightC,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)  (8-1235)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and            PpsVirtualBoundariesPosY[n]/SubHeightC−yCtbC−y is greater            than 0 and less than 3 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n]/SubHeightC−1,yCtbC+y+j)              (8-1236)        -   Otherwise, the following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)  (8-1237)    -   The variable applyVirtualBoundary may be derived as follows:        -   If [[one or more of]] the following condition[[s are]] is            true, applyVirtualBoundary is set equal to 0:            -   The bottom boundary of the current coding tree block is                the bottom boundary of the picture.            -   [[The bottom boundary of the current coding tree block                is the bottom boundary of the brick and                loop_filter_across_bricks_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the slice and                loop_filter_across_slices_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                one of the bottom virtual boundaries of the picture and                pps_loop_filter_across_virtual_boundaries_disabled_flag                is equal to 1.]]        -   — Otherwise, applyVirtualBoundary is set equal to 1.    -   The reconstructed sample offsets r1 and r2 are specified in        Table 8-22 according to the horizontal luma sample position y        and apply VirtualBoundary.

Alternatively, the condition “he bottom boundary of the current codingtree block is the bottom boundary of the picture” can be replaced by“the bottom boundary of the current coding tree block is the bottomboundary of the picture or outside the picture.”

5.4 Embodiment #4

This embodiment shows an example of disallowing using samples below theVPDU region in the ALF classification process (corresponding to bullet 7in section 4).

8.8.5.3 Derivation Process for ALF Transpose and Filter Index for LumaSamples

Inputs of this process are:

-   -   a luma location (xCtb, yCtb) specifying the top-left sample of        the current luma coding tree block relative to the top left        sample of the current picture,    -   a reconstructed luma picture sample array recPicture_(L) prior        to the adaptive loop filtering process.

Outputs of this process are

-   -   the classification filter index array filtIdx[x][y] with x, y=0        . . . CtbSizeY−1,    -   the transpose index array transposeIdx[x][y] with x, y=0 . . .        CtbSizeY−1.

The locations (h_(x+i), v_(y+j)) for each of the corresponding lumasamples (x, y) inside the given array recPicture of luma samples with i,j=−2 . . . 5 may be derived as follows:

-   -   If pps_loop_filter_across_virtual_boundaries_disabled_flag is        equal to 1 and xCtb+x−PpsVirtualBoundariesPosX[n] is greater        than or equal to 0 and less than 2 for any n=0 . . .        pps_num_ver_virtual_boundaries−1, the following applies:        h        _(x+i)=Clip3(PpsVirtualBoundariesPosX[n],pic_width_in_luma_samples−1,xCtb+x+i)  (8-1193)    -   Otherwise, if        pps_loop_filter_across_virtual_boundaries_disabled_flag is equal        to 1 and PpsVirtualBoundariesPosX[n]−xCtb−x is greater than 0        and less than 6 for any n=0 . . .        pps_num_ver_virtual_boundaries−1, the following applies:        h        _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]−1,xCtb+x+i)  (8-1194)    -   Otherwise, the following applies:        h _(x+i)=Clip3(0,pic_width_in_luma_samples−1,xCtb+x+i)  (8-1195)    -   If pps_loop_filter_across_virtual_boundaries_disabled_flag is        equal to 1 and yCtb+y−PpsVirtualBoundariesPosY[n] is greater        than or equal to 0 and less than 2 for any n=0 . . .        pps_num_hor_virtual_boundaries−1, the following applies:        v        _(y+j)=Clip3(PpsVirtualBoundariesPosY[n],pic_height_in_luma_samples−1,yCtb+y+j)  (8-1196)    -   Otherwise, if        pps_loop_filter_across_virtual_boundaries_disabled_flag is equal        to 1 and PpsVirtualBoundariesPosY[n]−yCtb−y is greater than 0        and less than 6 for any n=0 . . .        pps_num_hor_virtual_boundaries−1, the following applies:        v        _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n]−1,yCtb+y+j)  (8-1197)    -   Otherwise, the following applies:        -   If yCtb+CtbSizeY is greater than or equal to            pic_height_in_luma_samples, the following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples−1,yCtb+y+j)  (8-1198)        -   Otherwise, if y is less than CtbSizeY−4, the following            applies:            v _(y+j)=Clip3(0,yCtb+CtbSizeY−5,yCtb+y+j)  (8-1199)        -   Otherwise, the following applies:            v            _(y+j)=Clip3(yCtb+CtbSizeY−4,pic_height_in_luma_samples−1,yCtb+y+j)              (8-1200)            The classification filter index array filtIdx and the            transpose index array transposeIdx may be derived by the            following ordered steps:    -   1. The variables filtH[x][y], filtV[x][y], filtD0[x][y] and        filtD1[x][y] with x, y=−2 . . . CtbSizeY+1 may be derived as        follows:        -   If both x and y are even numbers or both x and y are uneven            numbers, the following applies:            filtH[x][y]=Abs((recPicture[h _(x) ,v _(y)]<<1)−recPicture[h            _(x−1) ,v _(y)]−recPicture[h _(x+1) ,v _(y)])  (8-1201)            filtV[x][y]=Abs((recPicture[h _(x) ,v _(y)]<<1)−recPicture[h            _(x) ,v _(y−1)]−recPicture[h _(x) ,v _(y+1)])  (8-1202)            filtD0[x][y]=Abs((recPicture[h _(x) ,v            _(y)]<<1)−recPicture[h _(x−1) ,v _(y−1)]−recPicture[h _(x+1)            ,v _(y)+1])  (8-1203)            filtD1[x][y]=Abs((recPicture[h _(x) ,v            _(y)]<<1)−recPicture[h _(x+1) ,v _(y−1)]−recPicture[h _(x−1)            ,v _(y)+1])  (8-1204)        -   Otherwise, filtH[x][y], filtV[x][y], filtD0[x][y] and            filtD1[x][y] are set equal to 0.    -   2. The variables minY, maxY and ac may be derived as follows:        -   If (y<<2) is equal to (min(CtbSizeY, 64)−8) [[(CtbSizeY−8)]]            and (yCtb+CtbSizeY) is less than            pic_height_in_luma_samples−1, minY is set equal to −2, maxY            is set equal to 3 and ac is set equal to 96.        -   Otherwise, if (y<<2) is equal to (min(CtbSizeY, 64)−4)            [[(CtbSizeY−4)]] and (yCtb+CtbSizeY) is less than            pic_height_in_luma_samples−1, minY is set equal to 0, maxY            is set equal to 5 and ac is set equal to 96.        -   Otherwise, minY is set equal to −2 and maxY is set equal to            5 and ac is set equal to 64.    -   3. The variables varTempH1[x][y], varTempV1[x][y],        varTempD01[x][y], varTempD11[x][y] and varTemp[x][y] with x, y=0        . . . (CtbSizeY−1)>>2 may be derived as follows:        sumH[x][y]=Σ _(i)Σ_(j)filtH[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1205)        sumV[x][y]=Σ _(i)Σ_(j)filtV[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1206)        sumD0[x][y]=Σ _(i)Σ_(j)filtD0[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1207)        sumD1[x][y]=Σ _(i)Σ_(j)filtD1[h _((x<<2)+i) −xCtb][h _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1208)        sumOfHV[x][y]=sumH[x][y]+sumV[x][y]  (8-1209)    -   4. The variables dirt[x][y], dir2[x][y] and dirS[x][y] with x,        y=0 . . . CtbSizeY−1 may be derived as follows:        -   The variables hv1, hv0 and dirHV may be derived as follows:            -   . . .        -   The variables d1, d0 and dirD may be derived as follows:            -   . . .    -   5. The variable avgVar[x][y] with x, y=0 . . . CtbSizeY−1 may be        derived as follows:        varTab[ ]={0,1,2,2,2,2,2,3,3,3,3,3,3,3,3,4}  (8-1227)        avgVar[x][y]=varTab[Clip3(0,15,(sumOfHV[x>>2][y>>2]*ac)>>(3+BitDepth_(Y)))]  (8-1228)    -   6. The classification filter index array filtIdx[x][y] and the        transpose index array transposeIdx[x][y] with x=y=0 . . .        CtbSizeY−1 may be derived as follows:        transposeTable[ ]={0,1,0,2,2,3,1,3}        transposeIdx[x][y]=transposeTable[dir1[x][y]*2+(dir2[x][y]>>1)]        filtIdx[x][y]=avgVar[x][y]        -   When dirS[x][y] is not equal 0, filtIdx[x][y] is modified as            follows:            filtIdx[x][y]+=(((dir1[x][y]&            0×1)<<1)+dirS[x][y])*5  (8-1229)

5.5 Embodiment #5

For samples located at multiple kinds of boundaries (e.g., slice/brickboundary, 360-degree virtual boundary), the padding process may only beinvoked once. Also, how many lines to be padded per side may bedependent on the location of current sample relative to the boundaries.

In one example, the ALF 2-side padding method is applied. Alternatively,furthermore, in the symmetric 2-side padding method, when a sample is attwo boundaries, e.g., one boundary in the above side and one boundary inthe below side, how many samples are padded is decided by the nearerboundary as shown in FIG. 27 . Meanwhile, when deriving theclassification information, only the 4 lines between the two boundariesin FIG. 27 may be used.

FIG. 26 shows an example of the padding methods if 4 lines of samplesare of two boundaries. In one example, the first boundary in FIG. 26 maybe the ALF virtual boundary; the second boundary in FIG. 25 may be theslice/tile/brick boundary or the 360-degree virtual boundary.

5.6 Embodiment #6

8.8.5.2 Coding Tree Block Filtering Process for Luma Samples

Inputs of this process are:

-   -   a reconstructed luma picture sample array recPicture_(L) prior        to the adaptive loop filtering process,    -   a filtered reconstructed luma picture sample array        alfPicture_(L),    -   a luma location (xCtb, yCtb) specifying the top-left sample of        the current luma coding tree block relative to the top left        sample of the current picture.

Output of this process is the modified filtered reconstructed lumapicture sample array alfPicture_(L).

The derivation process for filter index clause 8.8.5.3 is invoked withthe location (xCtb, yCtb) and the reconstructed luma picture samplearray recPicture_(L) as inputs, and filtIdx[x][y] and transposeIdx[x][y]with x, y=0 . . . CtbSizeY−1 as outputs.

-   -   The locations (h_(x+i), v_(y+j)) for each of the corresponding        luma samples (x, y) inside the given array recPicture of luma        samples with i, j=−3 . . . 3 may be derived as follows:        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and xCtb+x−PpsVirtualBoundariesPosX[n] is            greater than or equal to 0 and less than 3 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(PpsVirtualBoundariesPosX[n],pic_width_in_luma_samples−1,xCtb+x+i)  (8-1197)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosX[n]−xCtb−x is greater            than 0 and less than 4 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]−1,xCtb+x+i)  (8-1198)        -   Otherwise, the following applies:            h            _(x+i)=Clip3(0,pic_width_in_luma_samples−1,xCtb+x+i)  (8-1199)        -   [[If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and yCtb+y−PpsVirtualBoundariesPosY[n] is            greater than or equal to 0 and less than 3 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(PpsVirtualBoundariesPosY[n],pic_height_in_luma_samples−1,yCtb+y+j)  (8-1200)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosY[n−yCtb−y is greater            than 0 and less than 4 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n−1,yCtb+y+j)  (8-1201)]]        -   [[Otherwise, t]]The following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples−1,yCtb+y+j)  (8-1202)    -   [[The variable applyVirtualBoundary is derived as follows:        -   If one or more of the following conditions are true,            applyVirtualBoundary is set equal to 0:            -   The bottom boundary of the current coding tree block is                the bottom boundary of the picture.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the brick and                loop_filter_across_bricks_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the slice and                loop_filter_across_slices_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                one of the bottom virtual boundaries of the picture and                pps_loop_filter_across_virtual_boundaries_disabled_flag                is equal to 1.

        -   Otherwise, applyVirtualBoundary is set equal to 1.]]

        -   

TABLE 8-24 Specification of r1, r2, and r3 according to the horizontalluma sample position y and [[applyVirtualBoundary]] boundaryPos1 andboundary Pos2. condition r1 r2 r3 ( y = = CtbSizeY − 5 | | y = =CtbSizeY − 4 ) && ( applyVirtualBoundary 0 0 0 = = 1 ) ( y = = CtbSizeY− 6 | | y = = CtbSizeY − 3 ) && ( applyVirtualBoundary 1 1 1 = = 1 ) ( y= = CtbSizeY − 7 | | y = = CtbSizeY − 2 ) && ( applyVirtualBoundary 1 22 = = 1 ) otherwise 1 2 3 r r r condition 1 2 3 ( y = = boundaryPos1 − 1| | y = = boundaryPos1 ) && 0 0 0 ( boundaryPos1 > −1 && ( boundaryPos2= = −1 | | boundaryPos2 >= boundary Pos1 + 8 ) ) ( y = = boundaryPos1 −2 | | y = = boundaryPos1 +1) && 1 1 1 ( boundaryPos1 > −1 && (boundaryPos2 = = −1 | | boundaryPos2 >= boundary Pos1 + 8 ) ) ( y = =boundaryPos1 − 3 | | y = = boundaryPos1 +2) && 1 2 2 ( boundaryPos1 > −1&& ( boundaryPos2 = = −1 | | boundaryPos2 >= boundary Pos1 + 8 ) ) ( y == boundaryPos1 − 1 | | y = = boundaryPos1 | | y = = boundaryPos2 − 1 0 00 | | y = = boundaryPos2 ) && ( boundaryPos1 > −1 && boundaryPos2 = =boundaryPos1 + 4 ) ) ( y = = boundaryPos1 − 2 | | y = = boundaryPos1 + 1| | y = = 1 1 1 boundaryPos2 − 2 | | y = = boundaryPos2 + 1 && (boundaryPos1 > −1 && boundaryPos2 = = boundaryPos1 + 4 ) ) y = =boundaryPos1 − 3 | | y = = boundaryPos2 + 2 && 1 2 2 ( boundaryPos1 > −1&& boundaryPos2 = = boundaryPos1 + 4 ) ) otherwise 1 2 3

8.8.5.3 Derivation Process for ALF Transpose and Filter Index for LumaSamples

Inputs of this process are:

-   -   a luma location (xCtb, yCtb) specifying the top-left sample of        the current luma coding tree block relative to the top left        sample of the current picture,    -   a reconstructed luma picture sample array recPicture_(L) prior        to the adaptive loop filtering process.

Outputs of this process are

-   -   the classification filter index array filtIdx[x][y] with x, y=0        . . . CtbSizeY−1,    -   the transpose index array transposeIdx[x][y] with x, y=0 . . .        CtbSizeY−1.

The locations (h_(x+i), v_(y+j)) for each of the corresponding lumasamples (x, y) inside the given array recPicture of luma samples with i,j=−2 . . . 5 may be derived as follows:

-   -   If pps_loop_filter_across_virtual_boundaries_disabled_flag is        equal to 1 and xCtb+x−PpsVirtualBoundariesPosX[n] is greater        than or equal to 0 and less than 2 for any n=0 . . .        pps_num_ver_virtual_boundaries−1, the following applies:        h        _(x+i)=Clip3(PpsVirtualBoundariesPosX[n],pic_width_in_luma_samples−1,xCtb+x+i)  (8-1208)

    -   Otherwise, if        pps_loop_filter_across_virtual_boundaries_disabled_flag is equal        to 1 and PpsVirtualBoundariesPosX[n]−xCtb−x is greater than 0        and less than 6 for any n=0 . . .        pps_num_ver_virtual_boundaries−1, the following applies:        h        _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]−1,xCtb+x+i)  (8-1209)

    -   Otherwise, the following applies:        h _(x+i)=Clip3(0,pic_width_in_luma_samples−1,xCtb+x+i)  (8-1210)

    -   [[If pps_loop_filter_across_virtual_boundaries_disabled_flag is        equal to 1 and yCtb+y−PpsVirtualBoundariesPosY[n] is greater        than or equal to 0 and less than 2 for any n=0 . . .        pps_num_hor_virtual_boundaries−1, the following applies:        v        _(y+j)=Clip3(PpsVirtualBoundariesPosY[n],pic_height_in_luma_samples−1,yCtb+y+j)  (8-1211)

    -   Otherwise, if        pps_loop_filter_across_virtual_boundaries_disabled_flag is equal        to 1 and PpsVirtualBoundariesPosY[n]−yCtb−y is greater than 0        and less than 6 for any n=0 . . .        pps_num_hor_virtual_boundaries−1, the following applies:        v        _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n−1,yCtb+y+j)  (8-1212)

    -   Otherwise, the following applies:        -   If yCtb+CtbSizeY is greater than or equal to            pic_height_in_luma_samples, the following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples−1,yCtb+y+j)  (8-1213)        -   Otherwise, if y is less than CtbSizeY−4, the following            applies:            v _(y+j)=Clip3(0,yCtb+CtbSizeY−5,yCtb+y+j)  (8-1214)        -   Otherwise, the following applies:            v            _(y+j)=Clip3(yCtb+CtbSizeY−4,pic_height_in_luma_samples−1,yCtb+y+j)              (8-1215)]]

    -   

    -   -   

    -   -   

        -   

        -   

-   -   -   

        -   

        -   

        -   

        -   

The classification filter index array filtIdx and the transpose indexarray transposeIdx may be derived by the following ordered steps:

-   -   1. The variables filtH[x][y], filtV[x][y], filtD0[x][y] and        filtD1[x][y] with x, y=−2 . . . CtbSizeY+1 may be derived as        follows:        -   If both x and y are even numbers or both x and y are uneven            numbers, the following applies:            filtH[x][y]=Abs((recPicture[h _(x) ,v _(y)]<<1)−recPicture[h            _(x−1) ,v _(y)]−recPicture[h _(x+1) ,v _(y)])   (8-1216)            filtV[x][y]=Abs((recPicture[h _(x) ,v _(y)]<<1)−recPicture[h            _(x) ,v _(y−1)]−recPicture[h _(x) ,v _(y+1)])   (8-1217)            filtD0[x][y]=Abs((recPicture[h _(x) ,v            _(y)]<<1)−recPicture[h _(x−1) ,v _(y−1)]−recPicture[h _(x+1)            ,v _(y+1)])   (8-1218)            filtD1[x][y]=Abs((recPicture[h _(x) ,v            _(y)]<<1)−recPicture[h _(x+1) ,v _(y−1)]−recPicture[h _(x−1)            ,v _(y+1)])   (8-1219)        -   Otherwise, filtH[x][y], filtV[x][y], filtD0[x][y] and            filtD1[x][y] are set equal to 0.    -   2. The variables minY, maxY and ac may be derived as follows:        -   If (y<<2) is equal to (CtbSizeY−8) and (yCtb+CtbSizeY) is            less than pic_height_in_luma_samples−1, minY is set equal to            −2, maxY is set equal to 3 and ac is set equal to 96.

        -   Otherwise, if (y<<2) is equal to (CtbSizeY−4) and            (yCtb+CtbSizeY) is less than pic_height_in_luma_samples−1,            minY is set equal to 0, maxY is set equal to 5 and ac is set            equal to 96.

        -   

        -   -   

            -   

            -   

        -   -   

            -   

            -   

            -   

            -   

            -   

        -   

        -   [[Otherwise, minY is set equal to −2 and maxY is set equal            to 5 and ac is set equal to 64.]]    -   3. The variables sumH[x][y], sumV[x][y], sumD0[x][y],        sumD1[x][y] and sumOfHV[x][y] with x, y=0 . . . (CtbSizeY−1)>>2        may be derived as follows:        sumH[x][y]=Σ _(i)Σ_(j)filtH[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1220)        sumV[x][y]=Σ _(i)Σ_(j)filtV[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1221)        sumD0[x][y]=Σ _(i)Σ_(j)filtD0[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1222)        sumD1[x][y]=Σ _(i)Σ_(j)filtD1[h _((x<<2)+i) −xCtb][v _((y<<2)+j)        −yCtb] with i=−2 . . . 5,j=min Y . . . max Y  (8-1223)        sumOfHV[x][y]=sumH[x][y]+sumV[x][y]  (8-1224)

8.8.5.4 Coding Tree Block Filtering Process for Chroma Samples

Inputs of this process are:

-   -   a reconstructed chroma picture sample array recPicture prior to        the adaptive loop filtering process,    -   a filtered reconstructed chroma picture sample array alfPicture,    -   a chroma location (xCtbC, yCtbC) specifying the top-left sample        of the current chroma coding tree block relative to the top left        sample of the current picture.

Output of this process is the modified filtered reconstructed chromapicture sample array alfPicture.

The width and height of the current chroma coding tree block ctbWidthCand ctbHeightC may be derived as follows:ctbWidthC=CtbSizeY/SubWidthC  (8-1245)ctbHeightC=CtbSizeY/SubHeightC  (8-1246)

For the derivation of the filtered reconstructed chroma samplesalfPicture[x][y], each reconstructed chroma sample inside the currentchroma coding tree block recPicture[x][y] is filtered as follows withx=0 . . . ctbWidthC−1, y=0 . . . ctbHeightC−1:

-   -   The locations (h_(x+i), v_(y+j)) for each of the corresponding        chroma samples (x, y) inside the given array recPicture of        chroma samples with i, j=−2 . . . 2 may be derived as follows:        -   If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            xCtbC+x−PpsVirtualBoundariesPosX[n]/SubWidthC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(PpsVirtualBoundariesPosX[n]/SubWidthC,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1247)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and PpsVirtualBoundariesPosX[n]/SubWidthC−xCtbC−x            is greater than 0 and less than 3 for any n=0 . . .            pps_num_ver_virtual_boundaries−1, the following applies:            h            _(x+i)=Clip3(0,PpsVirtualBoundariesPosX[n]/SubWidthC−1,xCtbC+x+i)              (8-1248)        -   Otherwise, the following applies:            h            _(x+i)=Clip3(0,pic_width_in_luma_samples/SubWidthC−1,xCtbC+x+i)  (8-1249)        -   [[If pps_loop_filter_across_virtual_boundaries_disabled_flag            is equal to 1 and            yCtbC+y−PpsVirtualBoundariesPosY[n]/SubHeightC is greater            than or equal to 0 and less than 2 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(PpsVirtualBoundariesPosY[n]/SubHeightC,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)  (8-1250)        -   Otherwise, if            pps_loop_filter_across_virtual_boundaries_disabled_flag is            equal to 1 and            PpsVirtualBoundariesPosY[n]/SubHeightC−yCtbC−y is greater            than 0 and less than 3 for any n=0 . . .            pps_num_hor_virtual_boundaries−1, the following applies:            v            _(y+j)=Clip3(0,PpsVirtualBoundariesPosY[n]/SubHeightC−1,yCtbC+y+j)              (8-1251)        -   Otherwise, the]]            following applies:            v            _(y+j)=Clip3(0,pic_height_in_luma_samples/SubHeightC−1,yCtbC+y+j)              (8-1252)    -   [[The variable applyVirtualBoundary is derived as follows:        -   If one or more of the following conditions are true,            applyVirtualBoundary is set equal to 0:            -   The bottom boundary of the current coding tree block is                the bottom boundary of the picture.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the brick and                loop_filter_across_bricks_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                the bottom boundary of the slice and                loop_filter_across_slices_enabled_flag is equal to 0.            -   The bottom boundary of the current coding tree block is                one of the bottom virtual boundaries of the picture and                pps_loop_filter_across_virtual_boundaries_disabled_flag                is equal to 1.        -   Otherwise, applyVirtualBoundary is set equal to 1.]]    -   The variable boundaryPos1 and boundaryPos2 may be derived by        invoking the vertical boundary position derivation process for        luma samples as specified in 8.8.5.5 with yCtb equal to yCtb and        y equal to y.        -   The variable boundaryPos1 is set equal to            boundaryPos1/SubWidthC.        -   The variable boundaryPos2 is set equal to            boundaryPos2/SubWidthC.    -   The reconstructed sample offsets r1 and r2 are specified in        Table 8-24 according to the horizontal luma sample position y        and apply VirtualBoundary.    -   The variable curr may be derived as follows:        curr=recPicture[h _(x) ,v _(y)]  (8-1253)    -   The array of chroma filter coefficients f[j] and the array of        chroma clipping values c[j] may be derived as follows with j=0 .        . . 5:        f[j]=AlfCoeff_(C)[slice_alf_aps_id_chroma][j]   (8-1254)        c[j]=AlfClip_(C)[slice_alf_aps_id_chroma][j]   (8-1255)    -   The variable sum may be derived as follows:        sum=f[0]*(Clip3(−c[0],c[0],recPicture[h _(x) ,v        _(y+r2)]−curr)+Clip3(−c[0],c[0],recPicture[h _(x) ,v        _(y−r2)]−curr))+f[1]*(Clip3(−c[1],c[1],recPicture[h _(x+1) ,v        _(y+r1)]−curr)+Clip3(−c[1],c[1],recPicture[h _(x−1) ,v        _(y−r1)]−curr))+f[2]*(Clip3(−c[2],c[2],recPicture[h _(x) ,v        _(y+r1)]−curr)+Clip3(−c[2],c[2],recPicture[h _(x) ,v        _(y−r1)]−curr))+f[3]*(Clip3(−c[3],c[3],recPicture[h _(x−1) ,v        _(y+r1)]−curr)+Clip3(−c[3],c[3],recPicture[h _(x+1) ,v        _(y−r1)]−curr))+f[4]*(Clip3(−c[4],c[4],recPicture[h _(x+2) ,v        _(y)]−curr)+Clip3(−c[4],c[4],recPicture[h _(x−2) ,v        _(y)]−curr))+f[5]*(Clip3(−c[5],c[5],recPicture[h _(x+1) ,v        _(y)]−curr)+Clip3(−c[5],c[5],recPicture[h _(x−1) ,v        _(y)]−curr))  (8-1256)        sum=curr+(sum+64)>>7)  (8-1257)    -   The modified filtered reconstructed chroma picture sample        alfPicture[xCtbC+x][yCtbC+y] may be derived as follows:        -   If pcm_loop_filter_disabled_flag and            pcm_flag[(xCtbC+x)*SubWidthC][(yCtbC+y)*SubHeightC] are both            equal to 1, the following applies:            alfPicture[xCtbC+x][yCtbC+y]=recPicture_(L) [h _(x) ,v            _(y)]  (8-1258)        -   Otherwise (pcm_loop_filter_disabled_flag is equal to 0 or            pcm_flag[x][y] is equal 0), the following applies:            alfPicture[xCtbC+x][yCtbC+y]=Clip3(0,(1<<BitDepth_(C))−1,sum)  (8-1259)

TABLE 8-25 Specification of r1 and r2 according to the horizontal lumasample position y and boundaryPos1 and boundaryPos2 r r condition 1 2 (y = = boundaryPos1 − 1 | | y = = boundaryPos1 ) && 0 0 ( boundaryPos1 >−1 && ( boundaryPos2 = = −1 | | boundaryPos2 >= boundaryPos1 + 4 ) ) ( y= = boundaryPos1 − 2 | | y = = boundaryPos1 + 1) && 1 1 ( boundaryPos1 >−1 && ( boundaryPos2 = = −1 | | boundaryPos2 >= boundaryPos1 + 4 ) ) ( y= = boundaryPos1 − 1 | | y = = boundaryPos1 | | y = = boundaryPos2 − l || y 0 0 = = boundaryPos2 ) && ( boundaryPos1 > −1 && boundaryPos2 = =boundaryPos1 + 2 ) ) ( y = = boundaryPos1 − 2 | | y = = boundaryPos2 + 1) && 1 1 ( boundaryPos1 > −1 && boundaryPos2 = = boundaryPos1 + 2 ) )otherwise 1 2

-   -   

    -   

-   -   

    -   

    -   -   

        -   

        -   

        -   

        -   

    -   -   

        -   -   

        -   -   

        -   -   

        -   -   

        -   -   

            -   

    -   -   -   

        -   

    -   -   

        -   

    -   -   

        -   -   

            -   

        -   

FIG. 22 is a block diagram of a video processing apparatus 2200. Theapparatus 2200 may be used to implement one or more of the methodsdescribed herein. The apparatus 2200 may be embodied in a smartphone,tablet, computer, Internet of Things (IoT) receiver, and so on. Theapparatus 2200 may include one or more processors 2202, one or morememories 2204 and video processing hardware 2206. The processor(s) 2202may be configured to implement one or more methods described in thepresent document. The memory (memories) 2204 may be used for storingdata and code used for implementing the methods and techniques describedherein. The video processing hardware 2206 may be used to implement, inhardware circuitry, some techniques described in the present document.

In some embodiments, the video coding methods may be implemented usingan apparatus that is implemented on a hardware platform as describedwith respect to FIG. 22 .

FIG. 23 is a flowchart of an example method 2300 of video processing.The method includes determining (2302), for a conversion between acurrent video block of a video and a bitstream representation of thecurrent video block, one or more interpolation filters to use during theconversion, wherein the one or more interpolation filters are frommultiple interpolation filters for the video and performing (2304) theconversion using the one or more interpolation filters.

Various solutions and embodiments described in the present document arefurther described using a list of solutions.

Section 4, item 1 provides additional examples of the followingsolutions.

1. A method of video processing, comprising: performing a conversionbetween video blocks of a video picture and a bitstream representationthereof, wherein the video blocks are processed using logical groupingsof coding tree blocks, wherein the coding tree blocks are processedbased on whether a bottom boundary of a bottom coding tree block isoutside a bottom boundary of the video picture.

2. The method of solution 1, wherein the processing the coding treeblock includes performing an adaptive loop filtering of sample values ofthe coding tree block by using samples within the coding tree block.

3. The method of solution 1, wherein the processing the coding treeblock includes performing an adaptive loop filtering of sample values ofthe coding tree block by disabling splitting the coding tree block intotwo parts according to virtual boundaries.

Section 4, item 2 provides additional examples of the followingsolutions.

4. A method of video processing, comprising: determining, based on acondition of a coding tree block of a current video block, a usagestatus of virtual samples during an in-loop filtering; and performing aconversion between the video block and a bitstream representation of thevideo block consistent with the usage status of virtual samples.

5. The method of solution 4, wherein, a logical true value of the usagestatus indicates that the current video block is split at least to twoparts by a virtual boundary and filtering samples in one part isdisallowed to utilize the information from another part.

6. The method of solution 4, wherein, a logical true value of the usagestatus indicates virtual samples are used during the in-loop filtering,and wherein the in-loop filtering is performed using modified values ofreconstructed samples of the current video block.

7. The method of solution 4, wherein a logical false value of the usagestatus indicates that filtering samples in the block is allowed toutilize the information in the same block.

8. The method of solution 4, wherein, a logical true value of the usagestatus indicates the in-loop filtering is performed on reconstructedsamples of the current video block without further modifying thereconstructed samples.

9. The method of any of solutions 4-8, wherein the condition specifiesto set the usage status to the logical false value due to the codingtree block having a specific size.

10. The method of any of solutions 4-8, wherein the condition specifiesto set the usage status to the logical false value due to the codingtree block having a size greater than a specific size.

11. The method of any of solutions 4-8 tree block having a size lessthan a specific size.

Section 4, item 3 provides additional examples of the followingsolutions.

12. The method of solution 5, wherein the condition depends on whether abottom boundary of the current video block is a bottom boundary of avideo unit that is smaller than the video picture or the bottom boundaryof the current video block is a virtual boundary.

13. The method of solution 12, wherein the condition depends on whethera bottom boundary of the current video block is a bottom boundary of aslice or tile or brick boundary.

14. The method of solution 12, wherein the condition specifies to setthe usage status to the logical true value when the bottom boundary ofthe current video block is a bottom boundary of a slice or tile or brickboundary.

15. The method of solution 4-12, wherein the condition specifies to setthe usage status to the logical false value when the bottom boundary ofthe current video block is a bottom boundary of a picture boundary oroutside the bottom boundary of a picture boundary.

Section 4, item 4 provides additional examples of the followingsolutions.

16. A method of video processing, comprising: determining, during aconversion between a video picture that is logically grouped into one ormore video slices or video bricks, and a bitstream representation of thevideo picture, to disable a use of samples in another slice or brick inthe adaptive loop filter process; and performing the conversionconsistent with the determining.

Section 4, item 5 provides additional examples of the followingsolutions.

17. A method of video processing, comprising: determining, during aconversion between a current video block of a video picture and abitstream representation of the current video block, that the currentvideo block includes samples located at a boundary of a video unit ofthe video picture; and performing the conversion based on thedetermining, wherein the performing the conversion includes generatingvirtual samples for an in-loop filtering process using a unified methodthat is same for all boundary types in the video picture.

18. The method of solution 17, wherein the video unit is a slice or tileor 360-degree video.

19. The method of solution 17, wherein the in-loop filtering includesadaptive loop filtering.

20. The method of any of solutions 17-19, wherein the unified method isa two-side padding method.

21. The method of any of solutions 17-20, wherein the unified method iswhen accessing samples below a first line is disallowed and padding isutilized to generate virtual samples for those below the first line,then accessing samples above a second line is also set to be disallowedand padding is utilized to generate virtual samples for those above thesecond line.

22. The method of any of solutions 17-20, wherein the unified method iswhen accessing samples above a first line is disallowed and padding isutilized to generate virtual samples for those above the first line,then accessing samples below a second line is also set to be disallowedand padding is utilized to generate virtual samples for those below thesecond line.

23. The method of any of solutions 21-22, wherein the distance betweenthe first line and a current line where the current sample to befiltered is located and distance between the second line and the firstline is equal.

Section 4, item 6 provides additional examples of the followingsolutions.

24. A method of video processing, comprising: determining to apply,during a conversion between a current video block of a video picture anda bitstream representation thereof, one of multiple adaptive loop filter(ALF) sample selection methods available for the video picture duringthe conversion; and performing the conversion by applying the one ofmultiple ALF sample selection methods.

25. The method of solution 24, wherein the multiple ALF sample selectionmethods include a first method in which samples are selected before anin-loop filter is applied to the current video block during theconversion and a second method in which samples are selected after anin-loop filter is applied to the current video block during theconversion.

Section 4, item 7 provides additional examples of the followingsolutions.

26. A method of video processing, comprising: performing, based on aboundary rule, an in-loop filtering operation over samples of a currentvideo block of a video picture during a conversion between the currentvideo block and a bitstream representation of a current video block;wherein the boundary rule disables using samples that cross a virtualpipeline data unit (VPDU) of the video picture, and performing theconversion using a result of the in-loop filtering operation.

27. The method of solution 26, wherein the VPDU corresponds to a regionof the video picture having a fixed size.

28. The method of any of solutions 26-27, wherein the boundary rulefurther specifies to use virtual samples for the in-loop filtering inplace of disabled samples.

29. The method of solution 28, wherein the virtual samples are generatedby padding.

Section 4, item 8 provides additional examples of the followingsolutions.

30. A method of video processing, comprising: performing, based on aboundary rule, an in-loop filtering operation over samples of a currentvideo block of a video picture during a conversion between the currentvideo block and a bitstream representation of a current video block;wherein the boundary rule specifies to use, for locations of the currentvideo block across a video unit boundary, samples that are generatedwithout using padding; and performing the conversion using a result ofthe in-loop filtering operation.

31. The method of solution 30, wherein the samples are generated using atwo-side padding technique.

32. The method of solution 30, wherein the in-loop filtering operationcomprises using a same virtual sample generation technique forsymmetrically located samples during the in-loop filtering operation.

33. The method of any of solutions 30-32, wherein the in-loop filteringoperation over samples of the current video block includes performingreshaping of the samples of the current video block prior to applyingthe in-loop filtering.

Section 4, item 9 provides additional examples of the followingsolutions.

34. A method of video processing, comprising: performing, based on aboundary rule, an in-loop filtering operation over samples of a currentvideo block of a video picture during a conversion between the currentvideo block and a bitstream representation of a current video block;wherein the boundary rule specifies selecting, for the in-loop filteringoperation, a filter having dimensions such that samples of current videoblock used during the in-loop filtering do not cross a boundary of avideo unit of the video picture; and performing the conversion using aresult of the in-loop filtering operation.

Section 4, item 10 provides additional examples of the followingsolutions.

35. A method of video processing, comprising: performing, based on aboundary rule, an in-loop filtering operation over samples of a currentvideo block of a video picture during a conversion between the currentvideo block and a bitstream representation of a current video block;wherein the boundary rule specifies selecting, for the in-loop filteringoperation, clipping parameters or filter coefficients based on whetheror not padded samples are needed for the in-loop filtering; andperforming the conversion using a result of the in-loop filteringoperation.

36. The method of solution 35, wherein the clipping parameters or filtercoefficients are included in the bitstream representation.

Section 4, item 11 provides additional examples of the followingsolutions.

37. A method of video processing, comprising: performing, based on aboundary rule, an in-loop filtering operation over samples of a currentvideo block of a video picture during a conversion between the currentvideo block and a bitstream representation of a current video block;wherein the boundary rule depends on a color component identity of thecurrent video block; and performing the conversion using a result of thein-loop filtering operation.

38. The method of solution 37, wherein the boundary rule is differentfor luma and/or different color components.

39. The method of any of solutions 1-38, wherein the conversion includesencoding the current video block into the bitstream representation.

40. The method of any of solutions 1-38, wherein the conversion includesdecoding the bitstream representation to generate sample values of thecurrent video block.

41. A video encoding apparatus comprising a processor configured toimplement a method recited in any one or more of solutions 1-38.

42. A video decoding apparatus comprising a processor configured toimplement a method recited in any one or more of solutions 1-38.

43. A computer-readable medium having code stored thereon, the code,upon execution by a processor, causing the processor to implement amethod recited in any one or more of solutions 1-38.

FIG. 28 is a block diagram showing an example video processing system2800 in which various techniques disclosed herein may be implemented.Various implementations may include some or all of the components of thesystem 2800. The system 2800 may include input 2802 for receiving videocontent. The video content may be received in a raw or uncompressedformat, e.g., 8- or 10-bit multi-component pixel values, or may be in acompressed or encoded format. The input 2802 may represent a networkinterface, a peripheral bus interface, or a storage interface. Examplesof network interface include wired interfaces such as Ethernet, passiveoptical network (PON), etc. and wireless interfaces such as Wi-Fi orcellular interfaces.

The system 2800 may include a coding component 2804 that may implementthe various coding or encoding methods described in the presentdocument. The coding component 2804 may reduce the average bitrate ofvideo from the input 2802 to the output of the coding component 2804 toproduce a coded representation of the video. The coding techniques aretherefore sometimes called video compression or video transcodingtechniques. The output of the coding component 2804 may be eitherstored, or transmitted via a communication connected, as represented bythe component 2806. The stored or communicated bitstream (or coded)representation of the video received at the input 2802 may be used bythe component 2808 for generating pixel values or displayable video thatis sent to a display interface 2810. The process of generatinguser-viewable video from the bitstream representation is sometimescalled video decompression. Furthermore, while certain video processingoperations are referred to as “coding” operations or tools, it will beappreciated that the coding tools or operations are used at an encoderand corresponding decoding tools or operations that reverse the resultsof the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface mayinclude universal serial bus (USB) or high definition multimediainterface (HDMI) or DisplayPort, and so on. Examples of storageinterfaces include SATA (serial advanced technology attachment), PCI,IDE interface, and the like. The techniques described in the presentdocument may be embodied in various electronic devices such as mobilephones, laptops, smartphones or other devices that are capable ofperforming digital data processing and/or video display.

FIG. 29 is a flowchart representation of a method 2900 for videoprocessing in accordance with the present embodiments. The method 2900includes, at operation 2910, determining a classification of samples ofa block in a video picture of a video according to a rule. The videopicture is divided into multiple regions. The rule disallows use ofneighboring samples of a current sample across one or more boundaries ofthe multiple regions for the classification. The one or more boundariesof the multiple regions comprise a virtual boundary for an adaptive loopfiltering (ALF) process. The method 2900 also includes, at operation2920, performing a conversion between the block and a bitstreamrepresentation of the video by selectively applying an adaptive loopfilter according to the classification.

In some embodiments, a gradient of the current sample is not calculatedin case a neighboring sample of the current sample is unavailable forthe classification. In some embodiments, the gradient is considered tobe zero for the classification. In some embodiments, the gradient isexcluded in the classification.

In some embodiments, a directionality or an activity value of the blockfor the classification is scaled in case the set of neighboring samplesavailable for the classification is a subset of neighboring samples ofthe current sample. In some embodiments, the classification requiresgradients of N samples of the block while gradients are calculated foronly M samples in the block, wherein M and N are integers, M beingsmaller than N. The directionality or the activity value of the block isscaled by a factor that is based on M and N. In some embodiments, thefactor is N/M. In some embodiments, the factor is M^(N).

In some embodiments, the one or more boundaries comprise at least avertical boundary. In some embodiments, whether the classification isapplicable with respect to a 360 virtual boundary of the video regionused in 360-degree video coding is based on a location of the 360virtual boundary. In some embodiments, the classification is applicablewith respect to the 360 virtual boundary in case the 360 virtualboundary is co-located with an actual boundary of a coding tree unit. Insome embodiments, only a two-sided padding operation is applied forsamples located at the 360 virtual boundary in the ALF process. In someembodiments, the classification is not applicable with respect to the360 virtual boundary in case the 360 virtual boundary is separate froman actual boundary of a coding tree unit. In some embodiments, asingle-sided padding operation is applied for samples located at the 360virtual boundary in the ALF process. In some embodiments, the one ormore boundaries further comprise another virtual boundary, and atwo-sided padding operation is applied after the single-sided paddingoperation in the ALF process. In some embodiments, the multiple regionsinclude a slice, a brick, a tile, or a sub-picture.

In some embodiments, the conversion includes encoding the video into thebitstream representation. In some embodiments, the conversion includesdecoding the bitstream representation into the video.

From the foregoing, it will be appreciated that specific embodiments ofthe presently disclosed embodiments have been described herein forpurposes of illustration, but that various modifications may be madewithout deviating from the scope of the disclosed examples. Accordingly,the presently disclosed embodiments are not limited except as by theappended claims.

Some of the disclosed embodiments include making a decision ordetermination to enable a video processing tool or mode. In an example,when the video processing tool or mode is enabled, the encoder will useor implement the tool or mode in the processing of a block of video, butmay not necessarily modify the resulting bitstream based on the usage ofthe tool or mode. That is, a conversion from the block of video to thebitstream representation of the video will use the video processing toolor mode when it is enabled based on the decision or determination. Inanother example, when the video processing tool or mode is enabled, thedecoder will process the bitstream with the knowledge that the bitstreamhas been modified based on the video processing tool or mode. That is, aconversion from the bitstream representation of the video to the blockof video will be performed using the video processing tool or mode thatwas enabled based on the decision or determination.

Some of the disclosed embodiments include making a decision ordetermination to disable a video processing tool or mode. In an example,when the video processing tool or mode is disabled, the encoder will notuse the tool or mode in the conversion of the block of video to thebitstream representation of the video. In another example, when thevideo processing tool or mode is disabled, the decoder will process thebitstream with the knowledge that the bitstream has not been modifiedusing the video processing tool or mode that was enabled based on thedecision or determination.

Implementations of the subject matter and the functional operationsdescribed in this patent document can be implemented in various systems,digital electronic circuitry, or in computer software, firmware, orhardware, including the structures disclosed in this specification andtheir structural equivalents, or in combinations of one or more of them.Implementations of the subject matter described in this specificationcan be implemented as one or more computer program products, e.g., oneor more modules of computer program instructions encoded on a tangibleand non-transitory computer readable medium for execution by, or tocontrol the operation of, data processing apparatus. The computerreadable medium can be a machine-readable storage device, amachine-readable storage substrate, a memory device, a composition ofmatter effecting a machine-readable propagated signal, or a combinationof one or more of them. The term “data processing unit” or “dataprocessing apparatus” encompasses all apparatus, devices, and machinesfor processing data, including by way of example a programmableprocessor, a computer, or multiple processors or computers. Theapparatus can include, in addition to hardware, code that creates anexecution environment for the computer program in question, e.g., codethat constitutes processor firmware, a protocol stack, a databasemanagement system, an operating system, or a combination of one or moreof them.

A computer program (also known as a program, software, softwareapplication, script, or code) can be written in any form of programminglanguage, including compiled or interpreted languages, and it can bedeployed in any form, including as a stand-alone program or as a module,component, subroutine, or other unit suitable for use in a computingenvironment. A computer program does not necessarily correspond to afile in a file system. A program can be stored in a portion of a filethat holds other programs or data (e.g., one or more scripts stored in amarkup language document), in a single file dedicated to the program inquestion, or in multiple coordinated files (e.g., files that store oneor more modules, sub programs, or portions of code). A computer programcan be deployed to be executed on one computer or on multiple computersthat are located at one site or distributed across multiple sites andinterconnected by a communication network.

The processes and logic flows described in this specification can beperformed by one or more programmable processors executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Processors suitable for the execution of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read only memory ora random access memory or both. The essential elements of a computer area processor for performing instructions and one or more memory devicesfor storing instructions and data. Generally, a computer will alsoinclude, or be operatively coupled to receive data from or transfer datato, or both, one or more mass storage devices for storing data, e.g.,magnetic, magneto optical disks, or optical disks. However, a computerneed not have such devices. Computer readable media suitable for storingcomputer program instructions and data include all forms of nonvolatilememory, media and memory devices, including by way of examplesemiconductor memory devices, e.g., erasable programmable read-onlymemory (EPROM), electrically EPROM (EEPROM), and flash memory devices.The processor and the memory can be supplemented by, or incorporated in,special purpose logic circuitry.

It is intended that the specification, together with the drawings, beconsidered exemplary only, where exemplary means an example. As usedherein, the use of “or” is intended to include “and/or”, unless thecontext clearly indicates otherwise.

While this patent document contains many specifics, these should not beconstrued as limitations on the scope of any embodiment or of what maybe claimed, but rather as descriptions of features that may be specificto particular embodiments. Certain features that are described in thispatent document in the context of separate embodiments can also beimplemented in combination in a single embodiment. Conversely, variousfeatures that are described in the context of a single embodiment canalso be implemented in multiple embodiments separately or in anysuitable subcombination. Moreover, although features may be describedabove as acting in certain combinations and even initially claimed assuch, one or more features from a claimed combination can in some casesbe excised from the combination, and the claimed combination may bedirected to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. Moreover, the separation of various system components in theembodiments described in this patent document should not be understoodas requiring such separation in all embodiments.

Only a few implementations and examples are described and otherimplementations, enhancements and variations can be made based on whatis described and illustrated in this patent document.

What is claimed is:
 1. A method of processing video data, comprising:determining, for a conversion between a picture of a video comprisingone or more coding tree blocks and a bitstream of the video, that afirst filtering process is applied to a current coding tree block of theone or more coding tree blocks; determining a classification of an M×Nregion of the current coding tree block based on gradients derived froma P×Q region including the M×N region according to a rule, wherein therule disallows use of a sample in the P×Q region across one or moreboundaries of multiple kinds of video regions, and wherein the pictureis divided into multiple kinds of video regions, where M, N, P, and Qare positive integers, P is greater than M, and Q is greater than N; andperforming the conversion by applying the first filtering processaccording to the determined classification, wherein the first filteringprocess comprises: deriving a filtering coefficient set for the M×Nregion based on the determined classification; determining a clippingvalue set for the M×N region; and performing a filtering operation basedon the filtering coefficient set and the clipping value set.
 2. Themethod of claim 1, wherein the one or more boundaries at least comprisea 360-degree virtual boundary or a picture boundary.
 3. The method ofclaim 1, wherein a one-side padding process is applied to generate oneor more virtual samples for the sample across the one or moreboundaries, wherein the one or more virtual samples are copied fromavailable samples inside a video region in which the M×N region islocated.
 4. The method of claim 3, further comprising determiningwhether a virtual boundary is enabled for the current coding tree blockbased on a relationship between a bottom boundary of the current codingtree block and a bottom boundary of the picture.
 5. The method of claim4, wherein the virtual boundary is enabled if the bottom boundary of thecurrent coding tree block is not the bottom boundary of the picture. 6.The method of claim 4, wherein the virtual boundary is used to determinethe classification, and wherein samples outside the virtual boundary arenot used to determine the classification.
 7. The method of claim 1,wherein the one or more boundaries conditionally further comprise atleast one of: a slice boundary, a tile boundary, or a sub-pictureboundary.
 8. The method of claim 1, wherein the M×N region is a 4×4region and the P×Q region is a 10×10 region.
 9. The method of claim 1,wherein 1:2 subsampling is used when determining the classification. 10.The method of claim 1, wherein the first filtering process is anadaptive loop filtering process.
 11. The method of claim 1, wherein theconversion includes encoding the video into the bitstream.
 12. Themethod of claim 1, wherein the conversion includes decoding thebitstream into the video.
 13. An apparatus for processing video datacomprising a processor and a non-transitory memory with instructionsthereon, wherein the instructions upon execution by the processor, causethe processor to: determine, for a conversion between a picture of avideo comprising one or more coding tree blocks and a bitstream of thevideo, that a first filtering process is applied to a current codingtree block of the one or more coding tree blocks; determine aclassification of an M×N region of the current coding tree block basedon gradients derived from a P×Q region including the M×N regionaccording to a rule, wherein the rule disallows use of a sample in theP×Q region across one or more boundaries of multiple kinds of videoregions, and wherein the picture is divided into multiple kinds of videoregions, where M, N, P, and Q are positive integers, P is greater thanM, and Q is greater than N; and perform the conversion by applying thefirst filtering process according to the determined classification,wherein the first filtering process comprises: deriving a filteringcoefficient set for the M×N region based on the determinedclassification; determining a clipping value set for the M×N region; andperforming a filtering operation based on the filtering coefficient setand the clipping value set.
 14. The apparatus of claim 13, wherein theone or more boundaries at least comprise a 360-degree virtual boundaryor a picture boundary, wherein a one-side padding process is applied togenerate one or more virtual samples for the sample across the one ormore boundaries, wherein the one or more virtual samples are copied fromavailable samples inside a video region in which the M×N region islocated, and wherein the one or more boundaries conditionally furthercomprise at least one of: a slice boundary, a tile boundary, or asub-picture boundary.
 15. The apparatus of claim 13, wherein theprocessor is further caused to determine whether a virtual boundary isenabled for the current coding tree block based on a relationshipbetween a bottom boundary of the current coding tree block and a bottomboundary of the picture, wherein the virtual boundary is enabled if thebottom boundary of the current coding tree block is not the bottomboundary of the picture, wherein the virtual boundary is used todetermine the classification, and wherein samples outside the virtualboundary are not used to determine the classification, and wherein thefirst filtering process is an adaptive loop filtering process.
 16. Anon-transitory, computer-readable storage medium storing instructionsthat, when executed by a processor, cause the processor to: determine,for a conversion between a picture of a video comprising one or morecoding tree blocks and a bitstream of the video, that a first filteringprocess is applied to a current coding tree block of the one or morecoding tree blocks; determine a classification of an M×N region of thecurrent coding tree block based on gradients derived from a P×Q regionincluding the M×N region according to a rule, wherein the rule disallowsuse of a sample in the P×Q region across one or more boundaries ofmultiple kinds of video regions, and wherein the picture is divided intomultiple kinds of video regions, where M, N, P, and Q are positiveintegers, P is greater than M, and Q is greater than N; and perform theconversion by applying the first filtering process according to thedetermined classification, wherein the first filtering processcomprises: deriving a filtering coefficient set for the M×N region basedon the determined classification; determining a clipping value set forthe M×N region; and performing a filtering operation based on thefiltering coefficient set and the clipping value set.
 17. Thenon-transitory, computer-readable storage medium of claim 16, whereinthe one or more boundaries at least comprise a 360-degree virtualboundary or a picture boundary, wherein a one-side padding process isapplied to generate one or more virtual samples for the sample acrossthe one or more boundaries, wherein the one or more virtual samples arecopied from available samples inside a video region in which the M×Nregion is located, and wherein the one or more boundaries conditionallyfurther comprise at least one of: a slice boundary, a tile boundary, ora sub-picture boundary.
 18. The non-transitory, computer-readablestorage medium of claim 16, wherein the processor is further caused todetermine whether a virtual boundary is enabled for the current codingtree block based on a relationship between a bottom boundary of thecurrent coding tree block and a bottom boundary of the picture, whereinthe virtual boundary is enabled if the bottom boundary of the currentcoding tree block is not the bottom boundary of the picture, wherein thevirtual boundary is used to determine the classification, and whereinsamples outside the virtual boundary are not used to determine theclassification, and wherein the first filtering process is an adaptiveloop filtering process.
 19. A method for storing a bitstream of a video,wherein the method comprises: determining, for a picture of a videocomprising one or more coding tree blocks, that a first filteringprocess is applied to a current coding tree block of the one or morecoding tree blocks; determining a classification of an M×N region of thecurrent coding tree block based on gradients derived from a P×Q regionincluding the M×N region according to a rule, wherein the rule disallowsuse of a sample in the P×Q region across one or more boundaries ofmultiple kinds of video regions, and wherein the picture is divided intomultiple kinds of video regions, where M, N, P, and Q are positiveintegers, P is greater than M, and Q is greater than N; generating thebitstream by applying the first filtering process according to thedetermined classification, wherein the first filtering processcomprises: deriving a filtering coefficient set for the M×N region basedon the determined classification; determining a clipping value set forthe M×N region; and performing a filtering operation based on thefiltering coefficient set and the clipping value set; and storing thebitstream in a non-transitory computer-readable recording medium. 20.The method of claim 19, wherein the one or more boundaries at leastcomprise a 360-degree virtual boundary or a picture boundary, wherein aone-side padding process is applied to generate one or more virtualsamples for the sample across the one or more boundaries, wherein theone or more virtual samples are copied from available samples inside avideo region in which the M×N region is located, wherein the one or moreboundaries conditionally further comprise at least one of: a sliceboundary, a tile boundary, or a sub-picture boundary, wherein the methodfurther comprises determining whether a virtual boundary is enabled forthe current coding tree block based on a relationship between a bottomboundary of the current coding tree block and a bottom boundary of thepicture, wherein the virtual boundary is enabled if the bottom boundaryof the current coding tree block is not the bottom boundary of thepicture, wherein the virtual boundary is used to determine theclassification, and wherein samples outside the virtual boundary are notused to determine the classification, and wherein the first filteringprocess is an adaptive loop filtering process.